Sciweavers

14 search results - page 2 / 3
» An Approximate Subgame-Perfect Equilibrium Computation Techn...
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 5 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 5 months ago
Correlated Equilibria in Continuous Games: Characterization and Computation
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
Noah D. Stein, Pablo A. Parrilo, Asuman E. Ozdagla...
JACM
2007
160views more  JACM 2007»
13 years 5 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
13 years 11 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
CORR
2011
Springer
230views Education» more  CORR 2011»
13 years 17 days ago
Computational Rationalization: The Inverse Equilibrium Problem
Modeling the behavior of imperfect agents from a small number of observations is a difficult, but important task. In the singleagent decision-theoretic setting, inverse optimal co...
Kevin Waugh, Brian Ziebart, J. Andrew Bagnell