Sciweavers

176 search results - page 13 / 36
» Decision Problems for Nash Equilibria in Stochastic Games
Sort
View
ATAL
2006
Springer
13 years 11 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
CDC
2010
IEEE
117views Control Systems» more  CDC 2010»
13 years 2 months ago
Distributed iterative regularization algorithms for monotone Nash games
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
Aswin Kannan, Uday V. Shanbhag
ATAL
2007
Springer
14 years 1 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 8 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
WINE
2005
Springer
179views Economy» more  WINE 2005»
14 years 1 months ago
A Graph-Theoretic Network Security Game
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...