Sciweavers

5995 search results - page 72 / 1199
» Algorithmic Game Theory
Sort
View
121
Voted
CAV
2009
Springer
168views Hardware» more  CAV 2009»
15 years 8 months ago
Games through Nested Fixpoints
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consi...
Thomas Gawlitza, Helmut Seidl
ICALP
2010
Springer
15 years 5 months ago
Energy Parity Games
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative)...
Krishnendu Chatterjee, Laurent Doyen
ATAL
2005
Springer
15 years 7 months ago
Theory of moves learners: towards non-myopic equilibria
In contrast to classical game theoretic analysis of simultaneous and sequential play in bimatrix games, Steven Brams has proposed an alternative framework called the Theory of Mov...
Arjita Ghosh, Sandip Sen
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
14 years 12 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik
STOC
2012
ACM
256views Algorithms» more  STOC 2012»
13 years 4 months ago
Competitive contagion in networks
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
Sanjeev Goyal, Michael Kearns