Convex strategyproofness with an application to the probabilistic serial mechanism
Author
Abstract
Suggested Citation
DOI: 10.1007/s00355-015-0926-z
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.
- Katta, Akshay-Kumar & Sethuraman, Jay, 2006. "A solution to the random assignment problem on the full preference domain," Journal of Economic Theory, Elsevier, vol. 131(1), pages 231-250, November.
- Eric Budish & Yeon-Koo Che & Fuhito Kojima & Paul Milgrom, 2013. "Designing Random Allocation Mechanisms: Theory and Applications," American Economic Review, American Economic Association, vol. 103(2), pages 585-623, April.
- Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
- Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
- McLennan, Andrew, 2002. "Ordinal Efficiency and the Polyhedral Separating Hyperplane Theorem," Journal of Economic Theory, Elsevier, vol. 105(2), pages 435-449, August.
- Hadar, Josef & Russell, William R, 1969. "Rules for Ordering Uncertain Prospects," American Economic Review, American Economic Association, vol. 59(1), pages 25-34, March.
- Charalambos D. Aliprantis & Kim C. Border, 2006. "Infinite Dimensional Analysis," Springer Books, Springer, edition 0, number 978-3-540-29587-7, September.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Noda, Shunya, 2023. "A planner-optimal matching mechanism and its incentive compatibility in a restricted domain," Games and Economic Behavior, Elsevier, vol. 141(C), pages 364-379.
- Felix Brandt & Patrick Lederer, 2024. "Weak Strategyproofness in Randomized Social Choice," Papers 2412.11977, arXiv.org.
- Shichijo, Tatsuhiro & Fukuda, Emiko, 2021. "Cost-sharing mechanism for excludable goods with generalized non-rivalry," Journal of Economic Theory, Elsevier, vol. 193(C).
- Sulagna Dasgupta & Debasis Mishra, 2022. "Ordinal Bayesian incentive compatibility in random assignment model," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 651-664, December.
- Sulagna Dasgupta & Debasis Mishra, 2020.
"Ordinal Bayesian incentive compatibility in random assignment model,"
Papers
2009.13104, arXiv.org, revised May 2021.
- Sulagna Dasgupta & Debasis Mishra, 2020. "Ordinal Bayesian incentive compatibility in random assignment model," Discussion Papers 20-06, Indian Statistical Institute, Delhi.
- Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).
- Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
- Lê Nguyên Hoang, 2017. "Strategy-proofness of the randomized Condorcet voting system," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(3), pages 679-701, March.
- Karmokar, Madhuparna & Majumdar, Dipjyoti & Roy, Souvik, 2024. "Some further results on random OBIC rules," Mathematical Social Sciences, Elsevier, vol. 131(C), pages 102-112.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2014.
"Assigning agents to a line,"
Games and Economic Behavior, Elsevier, vol. 87(C), pages 539-553.
- Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2012. "Assigning agents to a line," Discussion Papers on Economics 11/2012, University of Southern Denmark, Department of Economics.
- HOUGAARD, Jens Leth & MORENO-TERNERO, Juan D & OSTERDAL, Lars Peter, 2014. "Assigning agents to a line," LIDAM Reprints CORE 2631, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- HOUGAARD, Jens L. & moreno-ternero, JUAN D. & OSTERDAL, Lars P., 2013. "Assigning agents to a line," LIDAM Discussion Papers CORE 2013015, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Jens L. Hougaard & Juan D. Moreno-Ternero & Lars P. Osterdal, 2014. "Assigning agents to a line," Working Papers 14.01, Universidad Pablo de Olavide, Department of Economics.
- Aziz, Haris & Brandl, Florian & Brandt, Felix & Brill, Markus, 2018. "On the tradeoff between efficiency and strategyproofness," Games and Economic Behavior, Elsevier, vol. 110(C), pages 1-18.
- Marek Bojko, 2020. "The Probabilistic Serial and Random Priority Mechanisms with Minimum Quotas," Papers 2012.11028, arXiv.org.
- Haris Aziz & Yoichi Kasajima, 2017. "Impossibilities for probabilistic assignment," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 255-275, August.
- Kesten, Onur, 2009. "Why do popular mechanisms lack efficiency in random environments?," Journal of Economic Theory, Elsevier, vol. 144(5), pages 2209-2226, September.
- Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
- Andrew McLennan & Shino Takayama & Yuki Tamura, 2024. "An Efficient, Computationally Tractable School Choice Mechanism," Discussion Papers Series 668, School of Economics, University of Queensland, Australia.
- Han, Xiang, 2024. "A theory of fair random allocation under priorities," Theoretical Economics, Econometric Society, vol. 19(3), July.
- Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).
- Miralles, Antonio & Pycia, Marek, 2021.
"Foundations of pseudomarkets: Walrasian equilibria for discrete resources,"
Journal of Economic Theory, Elsevier, vol. 196(C).
- Pycia, Marek & Miralles, Antonio, 2020. "Foundations of Pseudomarkets: Walrasian Equilibria for Discrete Resources," CEPR Discussion Papers 15161, C.E.P.R. Discussion Papers.
- Antonio Miralles & Marek Pycia, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," ECON - Working Papers 385, Department of Economics - University of Zurich.
- Onur Kesten & Morimitsu Kurino & Alexander S. Nesterov, 2017.
"Efficient lottery design,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 31-57, January.
- Kesten, Onur & Kurino, Morimitsu & Nesterov, Alexander, 2015. "Efficient lottery design," Discussion Papers, Research Unit: Market Behavior SP II 2015-203, WZB Berlin Social Science Center.
- Nguyen, Thành & Peivandi, Ahmad & Vohra, Rakesh, 2016. "Assignment problems with complementarities," Journal of Economic Theory, Elsevier, vol. 165(C), pages 209-241.
- Hashimoto, Tadashi, 2018. "The generalized random priority mechanism with budgets," Journal of Economic Theory, Elsevier, vol. 177(C), pages 708-733.
- Jingsheng Yu & Jun Zhang, 2020. "Efficient and fair trading algorithms in market design environments," Papers 2005.06878, arXiv.org, revised May 2021.
- Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
- Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
- Yeon-Koo Che & Fuhito Kojima, 2010.
"Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms,"
Econometrica, Econometric Society, vol. 78(5), pages 1625-1672, September.
- Yeon-Koo Che & Fuhito Kojima, 2008. "Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms," Cowles Foundation Discussion Papers 1677, Cowles Foundation for Research in Economics, Yale University.
- Ping Zhan, 2023. "Simultaneous eating algorithm and greedy algorithm in assignment problems," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-24, July.
- Wonki Jo Cho, 2018. "Probabilistic assignment: an extension approach," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(1), pages 137-162, June.
- Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:46:y:2016:i:3:d:10.1007_s00355-015-0926-z. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.