Crowdsourcing and all-pay auctions
Proceedings of the 10th ACM conference on Electronic commerce
Optimal crowdsourcing contests
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Mergers and collusion in all-pay auctions and crowdsourcing contests
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
All-pay auctions, a common mechanism for various human and agent interactions, suffers, like many other mechanisms, from the possibility of players' failure to participate in the auction. We model such failures and show how they affect the equilibrium state, revealing various properties, such as the lack of influence of the most-likely-to-participate player on the behavior of the other players. We perform this analysis with two scenarios: the sum-profit model, where the auctioneer obtains the sum of all submitted bids, and the max-profit model of crowd-sourcing contests, where the auctioneer can only use the best submissions and thus obtains only the winning bid. Furthermore, we examine various methods of influencing the probability of participation such as the effects of misreporting one's own probability of participating, and how influencing another player's participation chances (e.g., sabotage) changes the player's strategy.