Sciweavers

8 search results - page 1 / 2
» Ranking games that have competitiveness-based strategies
Sort
View
SIGECOM
2010
ACM
154views ECommerce» more  SIGECOM 2010»
13 years 8 months ago
Ranking games that have competitiveness-based strategies
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Kryst...
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
13 years 8 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
CSL
2008
Springer
13 years 5 months ago
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
Sven Schewe
ATAL
2008
Springer
13 years 5 months ago
Strategyproof deterministic lotteries under broadcast communication
The design of deterministic and fair mechanisms for selection among a set of self-motivated agents based solely on these agents' input is a major challenge in multiagent syst...
Alon Altman, Moshe Tennenholtz
WAW
2010
Springer
311views Algorithms» more  WAW 2010»
13 years 1 months ago
Game-Theoretic Models of Information Overload in Social Networks
We study the effect of information overload on user engagement in an asymmetric social network like Twitter. We introduce simple game-theoretic models that capture rate competition...
Christian Borgs, Jennifer T. Chayes, Brian Karrer,...