8 search results - page 1 / 2 » The Shapley value for directed graph games |
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we study false-name manipulations in weighted voting games. Weighted voting is a well-known model of cooperation among agents in decision-making domains. In such ga...
SIAMCOMP
2010
13 years 5 months ago
2010
Designing and deploying a network protocol determines the rules by which end users interact with each other and with the network. We consider the problem of designing a protocol t...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
AAAI
1996
13 years 8 months ago
1996
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have c...