Simultaneous contests with equal sharing allocation of prizes: computational complexity and price of anarchy
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 output...
主要な著者: | Elkind, E, Ghosh, A, Goldberg, PW |
---|---|
フォーマット: | Conference item |
言語: | English |
出版事項: |
Springer
2022
|
類似資料
-
Contests to incentivize a target group
著者:: Elkind, E, 等
出版事項: (2022) -
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem
著者:: Correa, Jose R., 等
出版事項: (2004) -
Continuous-time best-response and related dynamics in Tullock contests with convex costs
著者:: Elkind, E, 等
出版事項: (2024) -
The Price of Anarchy: Centralized versus Distributed Resource Allocation Trade-offs
著者:: Guo, Jinhong, 等
出版事項: (2021) -
The Price of Anarchy in the Queueing Models.
著者:: Kejun Wang
出版事項: (2014)