default search action
Aner Sela
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j26]Chen Cohen
, Ishay Rabi
Optimal seedings in interdependent contests. Ann. Oper. Res. 328(2): 1263-1285 (2023) - [j25]Yizhaq Minchuk
Subsidy and taxation in all-pay auctions under incomplete information. Games Econ. Behav. 140: 99-114 (2023) - [j24]Aner Sela
All-pay matching contests. Int. J. Game Theory 52(2): 587-606 (2023) - [j23]Alex Krumer
Strategic manipulations in round-robin tournaments. Math. Soc. Sci. 122: 50-57 (2023) - 2022
- [j22]Todd R. Kaplan
Second-Price Auctions with Private Entry Costs. Games 13(5): 62 (2022) - [j21]Chen Cohen
Assortative Matching by Lottery Contests. Games 13(5): 64 (2022) - 2021
- [j20]Aner Sela:
Reverse contests. Oper. Res. Lett. 49(3): 439-441 (2021) - 2020
- [j19]Aner Sela:
Optimal allocations of prizes and punishments in Tullock contests. Int. J. Game Theory 49(3): 749-771 (2020) - [j18]Alex Krumer, Reut Megidish, Aner Sela:
The optimal design of round-robin tournaments with three players. J. Sched. 23(3): 379-396 (2020) - [j17]Aner Sela, Oz Tsahi:
On the optimal allocation of prizes in best-of-three all-pay auctions. Soc. Choice Welf. 55(2): 255-273 (2020)
2010 – 2019
- 2019
- [j16]Chen Cohen
All-pay auctions with asymmetric effort constraints. Math. Soc. Sci. 97: 18-23 (2019) - 2018
- [j15]Yizhaq Minchuk
Prebidding first-price auctions with and without head starts. Math. Soc. Sci. 91: 51-55 (2018) - 2017
- [j14]Ezra Einy, Mridu Prabal Goswami, Ori Haimanko
Common-value all-pay auctions with asymmetric information. Int. J. Game Theory 46(1): 79-102 (2017) - [j13]Alex Krumer
First-mover advantage in round-robin tournaments. Soc. Choice Welf. 48(3): 633-658 (2017) - 2016
- [j12]Ezra Einy, Ori Haimanko
Common-value all-pay auctions with asymmetric information and bid caps. Int. J. Game Theory 45(1-2): 63-88 (2016) - 2014
- [j11]Yizhaq Minchuk
All-pay auctions with certain and uncertain prizes. Games Econ. Behav. 88: 130-134 (2014) - [j10]Reut Megidish, Aner Sela:
Sequential contests with synergy and budget constraints. Soc. Choice Welf. 42(1): 215-243 (2014) - [j9]Ella Segev
Sequential all-pay auctions with head starts. Soc. Choice Welf. 43(4): 893-923 (2014) - 2013
- [j8]Aner Sela, Eyal Erez:
Dynamic contests with resource constraints. Soc. Choice Welf. 41(4): 863-882 (2013)
2000 – 2009
- 2008
- [j7]Benny Moldovanu, Aner Sela, Xianwen Shi:
Competing auctions with endogenous quantities. J. Econ. Theory 141(1): 1-27 (2008) - 2006
- [j6]Gadi Fibich
All-pay auctions with risk-averse players. Int. J. Game Theory 34(4): 583-599 (2006) - [j5]Benny Moldovanu, Aner Sela:
Contest architecture. J. Econ. Theory 126(1): 70-96 (2006) - 2004
- [j4]Gadi Fibich
Revenue equivalence in asymmetric auctions. J. Econ. Theory 115(2): 309-321 (2004) - 2002
- [j3]Ezra Einy, Ori Haimanko
Dominant strategies, superior information, and winner's curse in second-price auctions. Int. J. Game Theory 30(3): 405-419 (2002) - 2000
- [j2]Aner Sela:
Fictitious Play in 2 × 3 Games. Games Econ. Behav. 31(1): 152-162 (2000)
1990 – 1999
- 1999
- [j1]Aner Sela, Dorothea Herreiner:
Fictitious play in coordination games. Int. J. Game Theory 28(2): 189-197 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: