Sciweavers

8 search results - page 1 / 2
» The Shapley value for directed graph games
Sort
View
ATAL
2008
Springer
13 years 5 months ago
Divide and conquer: false-name manipulations in weighted voting games
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...
Yoram Bachrach, Edith Elkind
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
13 years 2 months ago
Designing Network Protocols for Good Equilibria
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...
Ho-Lin Chen, Tim Roughgarden, Gregory Valiant
CONCUR
2006
Springer
13 years 7 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
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...
Krishnendu Chatterjee, Thomas A. Henzinger
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
13 years 10 months ago
The Complexity of Solving Stochastic Games on Graphs
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...
Daniel Andersson, Peter Bro Miltersen
AAAI
1996
13 years 5 months ago
Exploiting Graph Properties of Game Trees
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...
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de...