Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy

  title={Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy},
  author={Edith Elkind and Abheek Ghosh and Paul W Goldberg},
  booktitle={Algorithmic Game Theory},
. We study a general scenario of simultaneous contests that allocate prizes based on equal sharing: each contest awards its prize to all players who satisfy some contest-specific criterion, and the value of this prize to a winner decreases as the number of winners increases. The players produce outputs for a set of activities, and the winning criteria of the contests are based on these outputs. We consider two vari-ations of the model: (i) players have costs for producing outputs; (ii) players… 

Competition among Parallel Contests

An upper bound on the utility of any strategy is given and a method to construct a strategy whose utility can guarantee a constant ratio of this upper bound in the worst case is proposed.



Optimal Design of Crowdsourcing Contests

This paper represents the first general analysis of the economics of crowdsourcing contests, provides a simple rule of thumb for determining the optimal prize structure for practitioners who are considering designing such contests, and also discusses the welfare implications of organizing production or R&D as a Web-based contest of this kind.

Settling the complexity of computing two-player Nash equilibria

We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version) introduced by

Vertically Differentiated Simultaneous Vickrey Auctions: Theory and Experimental Evidence

Evidence of a probabilistic assortative matching between bidder and auction types is found and it is found that low risk type bidders tend to crowd on the highest auction and will pay a premium for the certainty it offers, whereas high risk types fail to appropriately adjust for risk associated with the lowest auction, leading to overbidding.

Settling the complexity of Nash equilibrium in congestion games

These problems are equivalent and the following equivalence of complexity classes are obtained: CCLS = PPAD ⋂ PLS, and PPAD ∩ PLS-complete.

Project games

This paper studies situations in which a project consisting of several activities is not executed as planned, and situations where some activities may be delayed and some Activities may be expedited.

Pure strategy solutions of blotto games

Some necessary conditions for a Blotto game to be solvable by interior pure strategies are presented. The mathematics involved is little more than an exercise in calculus. Nevertheless, a test of the

On Some Tighter Inapproximability Results

We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds for bounded occurrence satisfiability problems like MAX-2SAT and E2-LIN-2, and

Some blotto games

The following paper illustrates how each player should distribute his forces in certain interdiction games.