Sciweavers

19 search results - page 2 / 4
» Factor graph-based structural equilibria in dynamical games
Sort
View
AAAI
1998
14 years 15 days ago
The Dynamics of Reinforcement Learning in Cooperative Multiagent Systems
Reinforcement learning can provide a robust and natural means for agents to learn how to coordinate their action choices in multiagent systems. We examine some of the factors that...
Caroline Claus, Craig Boutilier
ATAL
2005
Springer
14 years 4 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
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
14 years 21 days ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 11 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 11 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