A MODEL OF GRAPH COLORING DYNAMICS WITH ATTENTION WAVES AND STRATEGIC WAITING

2009 ◽  
Vol 12 (06) ◽  
pp. 549-564 ◽  
Author(s):  
BORISLAV HADZHIEV ◽  
KATJA WINDT ◽  
WERNER BERGHOLZ ◽  
MARC-THORSTEN HÜTT
Keyword(s):  
Graph Coloring ◽  
Autonomous Agents ◽  
Human Subjects ◽  
Small World ◽  
Organizational Structures ◽  
Strong Increase ◽  
Avoidance Task ◽  
Surprising Result ◽  
Coloring Problem ◽  
Run Time

Recently, Kearns et al. [Kearns, M., Suri, S. and Montfort, N., An experimental study of the coloring problem on human subject networks, Science313 (2006) 824–827] studied the topology dependence of graph coloring dynamics. In their empirical study, the authors analyze, how a network of human subjects acting as autonomous agents performs in solving a conflict-avoidance task (the graph coloring problem) for different network architectures. A surprising result was that the run-time of the empirical dynamics decreases with the number of shortcuts in a Watts–Strogatz small-world graph. In a simulation of the dynamics based on randomly selecting color conflicts for update, they observe a strong increase of the run-time with the number of shortcuts. Here, we propose classes of strategies, which are capable of explaining the decrease in run-time with an increasing number of shortcuts. We show that the agent's strategy, the graph topology, and the complexity of the problem (essentially given by the graph's chromatic number) interact nontrivially yielding unexpected insights into the problem-solving capacity of organizational structures.

scholarly journals Human-agent coordination in a group formation game

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Tuomas Takko ◽  
Kunal Bhattacharya ◽  
Daniel Monsivais ◽  
Kimmo Kaski
Keyword(s):  
Decision Making ◽  
Autonomous Agents ◽  
Human Subjects ◽  
Group Formation ◽  
Small World ◽  
Human Agent ◽  
Human Decision ◽  
Overall Performance ◽  
Behaviour Changes ◽  
Formation Game

AbstractCoordination and cooperation between humans and autonomous agents in cooperative games raise interesting questions on human decision making and behaviour changes. Here we report our findings from a group formation game in a small-world network of different mixes of human and agent players, aiming to achieve connected clusters of the same colour by swapping places with neighbouring players using non-overlapping information. In the experiments the human players are incentivized by rewarding to prioritize their own cluster while the model of agents’ decision making is derived from our previous experiment of purely cooperative game between human players. The experiments were performed by grouping the players in three different setups to investigate the overall effect of having cooperative autonomous agents within teams. We observe that the human subjects adjust to autonomous agents by being less risk averse, while keeping the overall performance efficient by splitting the behaviour into selfish and cooperative actions performed during the rounds of the game. Moreover, results from two hybrid human-agent setups suggest that the group composition affects the evolution of clusters. Our findings indicate that in purely or lesser cooperative settings, providing more control to humans could help in maximizing the overall performance of hybrid systems.

A Metaheuristic Algorithm to Face the Graph Coloring Problem

2020 ◽  
pp. 195-208
Author(s):  
A. Guzmán-Ponce ◽  
J. R. Marcial-Romero ◽  
R. M. Valdovinos ◽  
R. Alejo ◽  
E. E. Granda-Gutiérrez
Keyword(s):  
Graph Coloring ◽  
Metaheuristic Algorithm ◽  
Coloring Problem ◽  
Graph Coloring Problem

scholarly journals Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem

Algorithms ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 246
Author(s):  
Yuri N. Sotskov ◽  
Еvangelina I. Mihova
Keyword(s):  
Graph Coloring ◽  
Precedence Constraints ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Due Dates ◽  
Mixed Graph ◽  
Coloring Problem ◽  
Release Times ◽  
Schedule Length ◽  
Graph Coloring Problem

This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizing maximal lateness for integer due dates to the scheduling problem, where along with precedence constraints given on the set of the multiprocessor tasks, a subset of tasks must be processed simultaneously. Contrary to a classical shop-scheduling problem, several processors must fulfill a multiprocessor task. Furthermore, two types of the precedence constraints may be given on the task set . We prove that the extended scheduling problem with integer release times of the jobs to minimize schedule length may be solved as an optimal mixed graph coloring problem that consists of the assignment of a minimal number of colors (positive integers) to the vertices of the mixed graph such that, if two vertices and are joined by the edge , their colors have to be different. Further, if two vertices and are joined by the arc , the color of vertex has to be no greater than the color of vertex . We prove two theorems, which imply that most analytical results proved so far for optimal colorings of the mixed graphs , have analogous results, which are valid for the extended scheduling problems to minimize the schedule length or maximal lateness, and vice versa.

scholarly journals A New and Fast Evolutionary Algorithm for Strict Strong Graph Coloring Problem

2015 ◽  
Vol 73 ◽  
pp. 138-145 ◽  
Author(s):  
Meriem Bensouyad ◽  
Nousseiba Guidoum ◽  
Djamel-Eddine Saïdouni
Keyword(s):  
Evolutionary Algorithm ◽  
Graph Coloring ◽  
Coloring Problem ◽  
Graph Coloring Problem
Sign in / Sign up

Export Citation Format

Share Document