Showing 1 - 10 of 20
competitors according to their ranks. For tournaments with four players we find optimal seedings with respect to three different … ranked teams; 3) maximization of the win probability for the top player. In addition, we find the seedings ensuring that …
Persistent link: https://www.econbiz.de/10010343975
Persistent link: https://www.econbiz.de/10014321393
Persistent link: https://www.econbiz.de/10009720760
Persistent link: https://www.econbiz.de/10014320922
Persistent link: https://www.econbiz.de/10012612928
This paper considers incentives for information acquisition ahead of conflicts. First, we characterize the (unique) equilibrium of the all-pay auction between two players with one-sided asymmetric information where one player has private information about his valuation. Then, we use ou rresults...
Persistent link: https://www.econbiz.de/10003950481
We study cheap-talk pre-play communication in the static all-pay auctions. For the case of two bidders, all correlated and communication equilibria are payoff equivalent to the Nash equilibrium if there is no reserve price, or if it is commonly known that one bidder has a strictly higher value....
Persistent link: https://www.econbiz.de/10009745257
Persistent link: https://www.econbiz.de/10010347867
We study a college admissions problem in which colleges accept students by ranking students’ efforts in entrance exams. Students’ ability levels affect the cost of their efforts. We solve and compare the equilibria of “centralized college admissions” (CCA) where students apply to all...
Persistent link: https://www.econbiz.de/10011437881
We theoretically and experimentally study a college admissions problem in which colleges accept students by ranking students' efforts in entrance exams. Students hold private information regarding their ability level that affects the cost of their efforts. We assume that student preferences are...
Persistent link: https://www.econbiz.de/10010413636