2322 search results - page 111 / 465 » On a game in directed graphs |
206
click to vote
SIAMDM
2008
15 years 6 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
177
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
164
click to vote
FMCO
2004
Springer
15 years 11 months ago
2004
Springer
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we ...
152
click to vote
IMCSIT
2010
15 years 4 months ago
2010
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
157
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...