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...
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Conference item |
| Språk: | English |
| Publicerad: |
Springer
2022
|