MbrlCatalogueTitleDetail

Do you wish to reserve the book?
Optimal large population Tullock contests
Optimal large population Tullock contests
Hey, we have placed the reservation for you!
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Optimal large population Tullock contests
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Title added to your shelf!
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Optimal large population Tullock contests
Optimal large population Tullock contests

Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
How would you like to get it?
We have requested the book for you! Sorry the robot delivery is not available at the moment
We have requested the book for you!
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Optimal large population Tullock contests
Optimal large population Tullock contests
Journal Article

Optimal large population Tullock contests

2023
Request Book From Autostore and Choose the Collection Method
Overview
Abstract We consider Tullock contests where contestants can be divided into a finite set of types according to their strategy cost function. Solving such contests is intractable if the number of players is finite but large and there are nonlinearities and asymmetries present. But by approximating the finite player contest with a large population model that can be solved in closed form, we can approximate equilibrium behavior in the finite player model. We then characterize the optimal bias parameters of the large population contest and interpret them as approximations of optimal bias parameters in finite player contests. We also identify conditions under which those parameters are increasing or decreasing according to the cost parameters. The parameters are biased in favor of high-cost agents if the cost functions are strictly convex and the likelihood of success is sufficiently responsive to strategy.
Publisher
Oxford University Press

MBRLCatalogueRelatedBooks