An algorithmic analysis of parallel contests
From MaRDI portal
Cites work
- ``Reverse nested lottery contests
- A class of games possessing pure-strategy Nash equilibria
- A model of parallel contests
- Asymmetric contests with general technologies
- Comparative Statics of Contests and Rent-Seeking Games
- Competing for talents
- Congestion games with player-specific payoff functions
- Contest architecture
- Crowdsourcing contests
- Equilibrium existence in Tullock contests with incomplete information
- Foundations for contest success functions
- Handbook of game theory and industrial organization. Volume I: Theory
- scientific article; zbMATH DE number 1233801 (Why is no real title available?)
- Learning in extensive-form games: Experimental data and simple dynamic models in the intermediate term
- Learning, Mutation, and Long Run Equilibria in Games
- Mixed equilibria in Tullock contests
- On the existence and uniqueness of pure Nash equilibrium in rent-seeking games
- On the existence of pure Nash equilibria in weighted congestion games
- Optimal allocations of prizes and punishments in tullock contests
- Parallel innovation contests
- Potential games
- Potential games are \textit{necessary} to ensure pure Nash equilibria in cost sharing games
- Robust Equilibria of Potential Games
- Strategy and dynamics in contests
- Strong equilibrium in congestion games
- The strategic equivalence of rent-seeking, innovation, and patent-race games.
- Unique equilibrium in contests with incomplete information
This page was built for publication: An algorithmic analysis of parallel contests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318545)
