Efficient Computation of Equilibria for Extensive Two-Person Games
TL;DR: In this paper, a two-person non-zero-sum game with perfect recall is considered, and an equilibrium is found efficiently by Lemke's algorithm, a generalization of the Lemke-Howson method.
read more
About: This article is published in Games and Economic Behavior. The article was published on 01 Jun 1996. and is currently open access. The article focuses on the topics: Normal-form game & Repeated game.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Faster Optimistic Online Mirror Descent for Extensive-Form Games
Huacong Jiang,W. Liu,Bin Li +2 more
- 01 Jan 2022
TL;DR: Adaptive Optimistic Online Mirror Descent (Ada-OOMD) as mentioned in this paper is a regret minimization algorithm for Online Convex Optimization (OCO), which is applied to solve Extensive-Form Games (EFGs) for approximating Nash equilibrium.
PyBNEq - A Tool for Computing Bayes-Nash Equilibria
TL;DR: PyBNEq is implemented in Python and has a graphical user interface, allowing the user to load/save/edit game data, and to find Bayes-Nash equilibria, and can be considered as a decision support system for solving games of incomplete information.
Efficient Learning in Polyhedral Games via Best-Response Oracles
Darshan Chakrabarti,Gabriele Farina,Christian Kroer +2 more
TL;DR: Efficient learning in polyhedral games via best-response oracles achieves constant regret in zero-sum games and O(T^0.25) regret in general-sum games using O(log t) best-response queries.
•Proceedings Article
A Game-Theoretic Approach to Determining Efficient Patrolling Strategies for Mobile Robots
Francesco Amigoni,Nicola Gatti,Antonio Ippedico +2 more
- 01 Jan 2008
TL;DR: A game-theoretic approach is adopted for finding an efficient strategy for a patrolling mobile robot that is considered playing a game against an hostile possible intruder.
Graph-based approach for enumerating the Nash equilibria of a two-player extensive-form game
07 Jun 2023
TL;DR: In this paper , a graph representation based on the notion of compatibility of strategies is proposed to enumerate all of the Nash equilibria of two-player extensive-form games with perfect information and perfect recall.
References
•Book
The Linear Complementarity Problem
Richard W. Cottle,Jong-Shi Pang,Richard Stone +2 more
- 18 Feb 1992
TL;DR: In this article, the authors present an overview of existing and multiplicity of degree theory and propose pivoting methods and iterative methods for degree analysis, including sensitivity and stability analysis.
3K
Equilibrium Points of Bimatrix Games
C. E. Lemke,J. T. Howson +1 more
TL;DR: An algebraic proof of the existence of equilibrium points for two-person non-zero-sum games is given in this paper, leading to an efficient scheme for computing an equilibrium point, which is valid for any ordered field.
1.2K
Bimatrix Equilibrium Points and Mathematical Programming
TL;DR: In this paper, simple constructive proofs are given of solutions to the matric matric system Mz − ω = q; z ≧ 0; ω ≧ 1; zT = 0, for various kinds of data M, q, which embrace quadratic programming and the problem of finding equilibrium points of bimatrix games.
On the complexity of the parity argument and other inefficient proofs of existence
Christos H. Papadimitriou
- 01 Jun 1994
TL;DR: Several new complexity classes of search problems, ''between'' the classes FP and FNP, are defined, based on lemmata such as ''every graph has an even number of odd-degree nodes.''