Aner Sela

According to our database1, Aner Sela authored at least 19 papers between 1999 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On the optimal allocation of prizes in best-of-three all-pay auctions.
Soc. Choice Welf., 2020

The optimal design of round-robin tournaments with three players.
J. Sched., 2020

Optimal allocations of prizes and punishments in Tullock contests.
Int. J. Game Theory, 2020

2019
All-pay auctions with asymmetric effort constraints.
Math. Soc. Sci., 2019

2018
Prebidding first-price auctions with and without head starts.
Math. Soc. Sci., 2018

2017
First-mover advantage in round-robin tournaments.
Soc. Choice Welf., 2017

Common-value all-pay auctions with asymmetric information.
Int. J. Game Theory, 2017

2016
Common-value all-pay auctions with asymmetric information and bid caps.
Int. J. Game Theory, 2016

2014
Sequential all-pay auctions with head starts.
Soc. Choice Welf., 2014

Sequential contests with synergy and budget constraints.
Soc. Choice Welf., 2014

All-pay auctions with certain and uncertain prizes.
Games Econ. Behav., 2014

2013
Dynamic contests with resource constraints.
Soc. Choice Welf., 2013

2008
Competing auctions with endogenous quantities.
J. Econ. Theory, 2008

2006
Contest architecture.
J. Econ. Theory, 2006

All-pay auctions with risk-averse players.
Int. J. Game Theory, 2006

2004
Revenue equivalence in asymmetric auctions.
J. Econ. Theory, 2004

2002
Dominant strategies, superior information, and winner's curse in second-price auctions.
Int. J. Game Theory, 2002

2000
Fictitious Play in 2 × 3 Games.
Games Econ. Behav., 2000

1999
Fictitious play in coordination games.
Int. J. Game Theory, 1999


  Loading...