Ranking games

DOI10.1016/j.artint.2008.10.008zbMath1188.91019OpenAlexW2914254234MaRDI 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

zbMATH Keywords

computational complexitygame theorymulti-agent systems\(n\)-player gamessolution conceptsstrict competitiveness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) (n)-person games, (n>2) (91A06)

Related Items (6)

Cost-sharing games with rank-based utilities ⋮ From Duels to Battlefields: Computing Equilibria of Blotto and Other Games ⋮ 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

• 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
• 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

This page was built for publication: Ranking games