Sciweavers

1683 search results - page 45 / 337
» Game Theory Basics
Sort
View
94
Voted
ATAL
2005
Springer
15 years 6 months ago
The value of privacy: optimal strategies for privacy minded agents
Agents often want to protect private information, while at the same acting upon the information. These two desires are in conflict, and this conflict can be modeled in strategic...
Sieuwert van Otterloo
ATAL
2005
Springer
15 years 6 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
120
Voted
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
14 years 11 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
CORR
2008
Springer
208views Education» more  CORR 2008»
15 years 27 days ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis
98
Voted
SIGECOM
2010
ACM
165views ECommerce» more  SIGECOM 2010»
15 years 5 months ago
Computing optimal strategies to commit to in extensive-form games
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
Joshua Letchford, Vincent Conitzer