Sciweavers

34 search results - page 1 / 7
» Finding Equilibria in Games of No Chance
Sort
View
COCOON
2007
Springer
14 years 5 months ago
Finding Equilibria in Games of No Chance
Abstract. We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show that a max...
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, T...
JUCS
2010
160views more  JUCS 2010»
13 years 5 months ago
How Incomputable is Finding Nash Equilibria?
Abstract: We investigate the Weihrauch-degree of several solution concepts from noncooperative game theory. While the consideration of Nash equilibria forms the core of our work, a...
Arno Pauly
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 4 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
JGAA
2007
123views more  JGAA 2007»
13 years 10 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta
IJCAI
2003
14 years 4 days ago
Local-Effect Games
We present a new class of games, local-effect games (LEGs), which exploit structure in a different way from other compact game representations studied in AI. We show both theoreti...
Kevin Leyton-Brown, Moshe Tennenholtz