We propose L-nets as a game model of concurrent interaction. L-nets, which correspond to strategies (in Games Semantics) or designs (in Ludics), are graphs rather than trees; the ...
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
Vishal Soni, Satinder P. Singh, Michael P. Wellman