Ranking games
From MaRDI portal
Publication:835803
DOI10.1016/j.artint.2008.10.008zbMath1188.91019MaRDI QIDQ835803
Felix Brandt, Felix Fischer, Paul Harrenstein, Yoav Shoham
Publication date: 31 August 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2008.10.008
computational complexity; game theory; multi-agent systems; \(n\)-player games; solution concepts; strict competitiveness
68Q25: Analysis of algorithms and problem complexity
91A10: Noncooperative games
91A06: (n)-person games, (n>2)
Related Items
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games, Cost-sharing games with rank-based utilities, Scheduling games with rank-based utilities, On the complexity of iterated weak dominance in constant-sum games, Price of Pareto optimality in hedonic games, Multi-issue social learning
Cites Work
- Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
- Unilaterally competitive games
- Subjectivity and correlation in randomized strategies
- Bimatrix games have quasi-strict equilibria
- Order independence for iterated weak dominance
- Coalition structure generation with worst case guarantees
- Oddness of the number of equilibrium points: a new proof
- Non-cooperative games
- The complexity of computing a Nash equilibrium
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- On the Value of Correlation
- On the Non-Transferable Utility Value: A Comment on the Roth-Shafer Examples
- Almost Strictly Competitive Games
- Refinements of the Nash equilibrium concept
- Computing correlated equilibria in multi-player games
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
