The following pages link to Optimal crowdsourcing contests (Q1735735):
Displaying 14 items.
- All-pay auctions with private signals about opponents' values (Q826042) (← links)
- Centralized vs decentralized contests (Q1667929) (← links)
- Crowdsourcing contests (Q2332996) (← links)
- Optimal crowdfunding design (Q2334128) (← links)
- Contests with dominant strategies (Q2677725) (← links)
- Differential treatment and the winner's effort in contests with incomplete information (Q2685827) (← links)
- Optimal orchestration of rewards and punishments in rank-order contests (Q2685851) (← links)
- Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems (Q3467653) (← links)
- Crowdsourcing contests with entry cost (Q6070506) (← links)
- On disclosure of participation in innovation contests: a dominance result (Q6179237) (← links)
- Optimal contests with incomplete information and convex effort costs (Q6194359) (← links)
- The contest game for crowdsourcing reviews (Q6546279) (← links)
- Sequential elimination in multi-stage all-pay auctions (Q6594855) (← links)
- Costly information providing in binary contests (Q6630733) (← links)