default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOnur Kesten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Tommy Andersson, Umut Dur
, Sinan Ertemel, Onur Kesten:
Sequential school choice with public and private schools. Soc. Choice Welf. 63(2): 231-276 (2024)- 2021
- [j12]Umut Mert Dur, Robert G. Hammond, Onur Kesten:
Sequential school choice: Theory and evidence from the field and lab. J. Econ. Theory 198: 105344 (2021) - [c4]Xiang Han, Onur Kesten, M. Utku Ünver:
Blood Allocation with Replacement Donors: A Theory of Multi-unit Exchange with Compatibility-based Preferences. EC 2021: 585-586
2010 – 2019
- 2019
- [j11]Yan Chen, Onur Kesten:
Chinese college admissions and school choice reforms: An experimental study. Games Econ. Behav. 115: 83-100 (2019) - [j10]Onur Kesten, Morimitsu Kurino:
Strategy-proof improvements upon deferred acceptance: A maximal domain for possibility. Games Econ. Behav. 117: 120-143 (2019) - 2018
- [j9]Yan Chen, Ming Jiang, Onur Kesten, Stéphane Robin, Min Zhu:
Matching in the large: An experimental study. Games Econ. Behav. 110: 295-317 (2018) - 2017
- [j8]Onur Kesten, Morimitsu Kurino, M. Utku Ünver:
On characterizations of the probabilistic serial mechanism involving incentive and invariance properties. Math. Soc. Sci. 90: 56-62 (2017) - [j7]Onur Kesten, Morimitsu Kurino, Alexander S. Nesterov:
Efficient lottery design. Soc. Choice Welf. 48(1): 31-57 (2017) - 2016
- [j6]Özgün Ekici, Onur Kesten:
An equilibrium analysis of the probabilistic serial mechanism. Int. J. Game Theory 45(3): 655-674 (2016) - [j5]Vincent W. Slaugh, Mustafa Akan, Onur Kesten, M. Utku Ünver:
The Pennsylvania Adoption Exchange Improves Its Matching Process. Interfaces 46(2): 133-153 (2016) - 2011
- [c3]Yan Chen, Onur Kesten:
From Boston to Shanghai to Deferred Acceptance: Theory and Experiments on a Family of School Choice Mechanisms. AMMA 2011: 58-59 - 2010
- [c2]Onur Kesten, M. Utku Ünver:
Lottery mechanism design for school choice. BQGT 2010: 98:1
2000 – 2009
- 2009
- [j4]Onur Kesten:
Coalitional strategy-proofness and resource monotonicity for house allocation problems. Int. J. Game Theory 38(1): 17-21 (2009) - [j3]Onur Kesten:
Why do popular mechanisms lack efficiency in random environments? J. Econ. Theory 144(5): 2209-2226 (2009) - [c1]Liye Ma, Onur Kesten, Tridas Mukhopadhyay:
Attracting Whom? - Managing User-Generated-Content Communities for Monetization. ICIS 2009: 8 - 2006
- [j2]Onur Kesten:
On two competing mechanisms for priority-based allocation problems. J. Econ. Theory 127(1): 155-171 (2006) - [j1]Onur Kesten:
More on the uniform rule: Characterizations without Pareto optimality. Math. Soc. Sci. 51(2): 192-200 (2006)
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-04 21:00 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:
