Computing equilibria in multi-player games
From MaRDI portal
Recommendations
Cited in
(37)- Symmetries and the complexity of pure Nash equilibrium
- Perspectives on multiagent learning
- Nash equilibria in all-optical networks
- Nash and correlated equilibria: Some complexity considerations
- Selecting efficient correlated equilibria through distributed learning
- Approximate Nash equilibria in anonymous games
- Algorithmic rationality: game theory with costly computation
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation
- A computational method for solving \(n\)-person game
- Directed graphical structure, Nash equilibrium, and potential games
- Computing Equilibria with Partial Commitment
- Multilinear games
- Algorithms for multiplayer multicommodity flow problems
- Pairwise-interaction games
- Computing Stable Outcomes in Hedonic Games
- Computing Game Metrics on Markov Decision Processes
- ETR-completeness for decision versions of multi-player (symmetric) Nash equilibria
- Computing Equilibria in Large Games We Play
- Probabilistic Techniques in Algorithmic Game Theory
- Computation of correlated equilibrium with global-optimal expected social welfare
- Nash equilibria: complexity, symmetries, and approximation
- Computing Equilibria of Dynamic Games
- On the Hardness and Existence of Quasi-Strict Equilibria
- Computing Supergame Equilibria
- Algorithms – ESA 2005
- Computing correlated equilibria in multi-player games
- Computing correlated equilibria in multi-player games
- Buyer-supplier games: optimization over the core
- Equilibria of graphical games with symmetries
- Correlated equilibria in continuous games: characterization and computation
- Equilibria problems on games: complexity versus succinctness
- Combinatorics of Correlated Equilibria
- Some results of Maria Serna on strategic games: complexity of equilibria and models
- Computing the cores of strategic games with punishment-dominance relations
- Good neighbors are hard to find: Computational complexity of network formation
- Walrasian equilibrium: Hardness, approximations and tractable instances
- A computational analysis of the tournament equilibrium set
This page was built for publication: Computing equilibria in multi-player games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921656)
