Sciweavers

54 search results - page 6 / 11
» Correlated equilibria in graphical games
Sort
View
AAAI
2012
12 years 1 months ago
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
Joshua Letchford, Liam MacDermed, Vincent Conitzer...
CG
2006
Springer
14 years 2 months ago
Computing Proper Equilibria of Zero-Sum Games
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
Peter Bro Miltersen, Troels Bjerre Sørensen
EOR
2008
88views more  EOR 2008»
13 years 11 months ago
Selection of a correlated equilibrium in Markov stopping games
This paper deals with an extension of the concept of correlated strategies to Markov stopping games. The Nash equilibrium approach to solving nonzero-sum stopping games may give m...
David M. Ramsey, Krzysztof Szajowski
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
14 years 4 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
WINE
2010
Springer
162views Economy» more  WINE 2010»
13 years 8 months ago
Near-Strong Equilibria in Network Creation Games
We introduce a new solution concept for games, near-strong equilibrium, a variation of strong equilibrium. Previous work has shown the existence of 2-strong pure strategy equilibr...
Ola Rozenfeld, Moshe Tennenholtz