Multilinear Games
From MaRDI portal
Publication:2959817
DOI10.1007/978-3-662-54110-4_4zbMath1404.91036OpenAlexW2913723619WikidataQ60521609 ScholiaQ60521609MaRDI QIDQ2959817
Hau Chan, Albert Xin Jiang, Ruta Mehta, Kevin Leyton-Brown
Publication date: 10 February 2017
Published in: Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54110-4_4
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Utility theory for games (91A30)
Related Items (1)
Cites Work
- Action-graph games
- The ellipsoid method and its consequences in combinatorial optimization
- On the complexity of the parity argument and other inefficient proofs of existence
- Nash and Walras equilibrium via Brouwer
- Multi-agent influence diagrams for representing and solving games.
- Polynomial-time computation of exact correlated equilibrium in compact games
- Non-cooperative games
- Rational Generating Functions and Integer Programming Games
- The complexity of computing a Nash equilibrium
- Multilinear Games
- Empirical Distribution of Equilibrium Play and Its Testing Application
- Security and Game Theory
- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
- Dueling algorithms
- Computing correlated equilibria in multi-player games
This page was built for publication: Multilinear Games
