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)