Simultaneous contests with equal sharing allocation of prizes: computational complexity and price of anarchy

DOI10.1007/978-3-031-15714-1_8zbMath1520.91014arXiv2207.08151OpenAlexW4297818593MaRDI QIDQ6164505

Abheek Ghosh, Edith Elkind, Paul W. Goldberg

Publication date: 28 July 2023

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.08151

zbMATH Keywords

computational complexityequilibrium analysiscontest theory

Mathematics Subject Classification ID

Noncooperative games (91A10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithmic game theory and complexity (91A68)

Cites Work

• Unnamed Item
• Pure strategy Nash equilibria in non-zero sum Colonel Blotto games
• A Blotto game with incomplete information
• How easy is local search?
• On the complexity of the parity argument and other inefficient proofs of existence
• Potential games
• A strategic approach to multiple estate division problems
• Discrete Colonel Blotto and general lotto games
• The Colonel Blotto game
• OR Forum—Blotto Politics
• Vertically Differentiated Simultaneous Vickrey Auctions: Theory and Experimental Evidence
• Simple Local Search Problems that are Hard to Solve
• Settling the complexity of computing two-player Nash equilibria
• The complexity of pure Nash equilibria
• Systems defense games: Colonel blotto, command and control
• The Complexity of Computing a Nash Equilibrium
• On “Colonel Blotto” and Analogous Games
• Automata, Languages and Programming
• Project games
• The complexity of gradient descent: CLS = PPAD ∩ PLS
• Settling the complexity of Nash equilibrium in congestion games

This page was built for publication: Simultaneous contests with equal sharing allocation of prizes: computational complexity and price of anarchy