Narrow search
Showing 541 - 550 of 156,692
Cover Image
Sequential round-robin tournaments with multiple prizes
Laica, Christoph; Lauber, Arne; Sahm, Marco - 2017 - This version: October 6, 2017
We examine the fairness and intensity of sequential round-robin tournaments with multiple prizes. With three symmetric players and two prizes, the tournament is completely fair if and only if the second prize is valued half of the first prize, regardless of whether matches are organized as...
Persistent link: https://www.econbiz.de/10011735948
Cover Image
Sequential round-robin tournaments with multiple prizes
Laica, Christoph; Lauber, Arne; Sahm, Marco - 2017 - This version: October 6, 2017
We examine the fairness and intensity of sequential round-robin tournaments with multiple prizes. With three symmetric players and two prizes, the tournament is completely fair if and only if the second prize is valued half of the first prize, regardless of whether matches are organized as...
Persistent link: https://www.econbiz.de/10011743460
Cover Image
Are sequential round-robin tournaments discriminatory?
Sahm, Marco - 2017
higher discriminating power of the all-pay auction. Moreover, the resulting discouragement effect in tournaments with all …
Persistent link: https://www.econbiz.de/10011638282
Cover Image
Are sequential round-robin tournaments discriminatory?
Sahm, Marco - 2017
higher discriminating power of the all-pay auction. Moreover, the resulting discouragement effect in tournaments with all …
Persistent link: https://www.econbiz.de/10011632264
Cover Image
Nash equilibria in all-pay auctions with discrete strategy space
Li, Zheng - 2017
Using two-player all-pay auctions, the author fully characterizes the Nash equilibrium under a discrete bidding strategy space. In particular, he shows that under the random tiebreaking rule, the cardinality of the set of Nash equilibrium depends on the parity of the reward size and a continuum...
Persistent link: https://www.econbiz.de/10011650359
Cover Image
Optimal and fair prizing in sequential round-robin tournaments : experimental evidence
Lauber, Arne; March, Christoph; Sahm, Marco - 2022
We report results from the first experimental study of round-robin tournaments. In our experiment, we investigate how the prize structure affects the intensity, fairness, and dynamic behavior in sequential round-robin tournaments with three players. We compare tournaments with a second prize...
Persistent link: https://www.econbiz.de/10013185940
Cover Image
Optimal accuracy of unbiased Tullock contests with two heterogeneous players
Sahm, Marco - 2022
contest with an all-pay auction equilibrium (r ≥ 2). By contrast, if she aims at maximizing the expected aggregate effort or …
Persistent link: https://www.econbiz.de/10013172104
Cover Image
Optimal accuracy of unbiased tullock contests with two heterogeneous players
Sahm, Marco - In: Games 13 (2022) 2, pp. 1-6
contest with an all-pay auction equilibrium (r≥2). By contrast, if she aims at maximizing the expected aggregate effort or the …
Persistent link: https://www.econbiz.de/10013172435
Cover Image
Optimal and fair prizing in sequential round-robin tournaments : experimental evidence
Lauber, Arne; March, Christoph; Sahm, Marco - 2022
We report results from the first experimental study of round-robin tournaments. In our experiment, we investigate how the prize structure affects the intensity, fair-ness, and dynamic behavior in sequential round-robin tournaments with three players. We compare tournaments with a second prize...
Persistent link: https://www.econbiz.de/10013167956
Cover Image
The Strategy of Conflict and Cooperation
Ismail, Mehmet - 2021
The story of conflict and cooperation has started millions of years ago, and now it is everywhere: In biology, computer … "each player acts independently without collaboration with any of the others" (Nash, 1951)—fully capture the competition … act independently. Coalitional strategic games unify the study of strategic competition as well as cooperation including …
Persistent link: https://www.econbiz.de/10013238411