IDEAS home Printed from https://ideas.repec.org/f/pba1381.html
   My authors  Follow this author

Ivan Balbuzanov

Personal Details

First Name:Ivan
Middle Name:
Last Name:Balbuzanov
Suffix:
RePEc Short-ID:pba1381
[This author has chosen not to make the email address public]
http://sites.google.com/site/ibalbuzanov/
Terminal Degree:2015 Department of Economics; University of California-Berkeley (from RePEc Genealogy)

Affiliation

(99%) Department of Economics
Faculty of Business and Economics
University of Melbourne

Melbourne, Australia
http://www.economics.unimelb.edu.au/
RePEc:edi:demelau (more details at EDIRC)

(1%) Centre for Market Design
Faculty of Business and Economics
University of Melbourne

Melbourne, Australia
https://fbe.unimelb.edu.au/cmd
RePEc:edi:edmelau (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Jacob Coreno & Ivan Balbuzanov, 2022. "Axiomatic Characterizations of Draft Rules," Papers 2204.08300, arXiv.org, revised Mar 2024.
  2. Balbuzanov, Ivan & Kotowski, Maciej, 2019. "The Property Rights Theory of Production Networks," Working Paper Series rwp19-033, Harvard University, John F. Kennedy School of Government.
  3. Balbuzanov, Ivan & Kotowski, Maciej H., 2017. "Endowments, Exclusion, and Exchange," Working Paper Series rwp17-016, Harvard University, John F. Kennedy School of Government.

Articles

  1. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
  2. Balbuzanov, Ivan, 2020. "Short trading cycles: Paired kidney exchange with strict ordinal preferences," Mathematical Social Sciences, Elsevier, vol. 104(C), pages 78-87.
  3. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
  4. Ivan Balbuzanov, 2019. "Lies and consequences," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(4), pages 1203-1240, December.
  5. Ivan Balbuzanov, 2016. "Convex strategyproofness with an application to the probabilistic serial mechanism," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(3), pages 511-520, March.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. Balbuzanov, Ivan & Kotowski, Maciej H., 2017. "Endowments, Exclusion, and Exchange," Working Paper Series rwp17-016, Harvard University, John F. Kennedy School of Government.

    Cited by:

    1. Maria Gabriella Graziano & Claudia Meo & Nicholas C. Yannelis, 2020. "Shapley and Scarf housing markets with consumption externalities," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 22(5), pages 1481-1514, September.
    2. Federico Echenique & Antonio Miralles & Jun Zhang, 2019. "Fairness and efficiency for probabilistic allocations with participation constraints," Papers 1908.04336, arXiv.org, revised May 2020.
    3. Echenique, Federico & Miralles, Antonio & Zhang, Jun, 2021. "Fairness and efficiency for allocations with participation constraints," Journal of Economic Theory, Elsevier, vol. 195(C).
    4. Jun Zhang, 2020. "Cores in discrete exchange economies with complex endowments," Papers 2005.09351, arXiv.org, revised May 2021.
    5. Carlos Hervés-Beloso & Emma Moreno-García, 2022. "Revisiting the Coase theorem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 73(2), pages 421-438, April.
    6. Morimitsu Kurino & Tetsutaro Hatakeyama, 2022. "Inter-attribute equity in assignment problems: Leveling the playing field by priority design," Keio-IES Discussion Paper Series 2022-009, Institute for Economics Studies, Keio University.

Articles

  1. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).

    Cited by:

    1. Ping Zhan, 2023. "A Simple Characterization of Assignment Mechanisms on Set Constraints," SN Operations Research Forum, Springer, vol. 4(2), pages 1-15, June.
    2. 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.
    3. Aziz, Haris & Brandl, Florian, 2022. "The vigilant eating rule: A general approach for probabilistic economic design with constraints," Games and Economic Behavior, Elsevier, vol. 135(C), pages 168-187.
    4. Haris Aziz & Florian Brandl, 2020. "The Vigilant Eating Rule: A General Approach for Probabilistic Economic Design with Constraints," Papers 2008.08991, arXiv.org, revised Jul 2021.
    5. Ping Zhan, 2023. "Simultaneous eating algorithm and greedy algorithm in assignment problems," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-24, July.
    6. Mustafa Oğuz Afacan, 2023. "Axiomatic characterizations of the constrained probabilistic serial mechanism," Theory and Decision, Springer, vol. 95(3), pages 465-484, October.

  2. Balbuzanov, Ivan, 2020. "Short trading cycles: Paired kidney exchange with strict ordinal preferences," Mathematical Social Sciences, Elsevier, vol. 104(C), pages 78-87.

    Cited by:

    1. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).

  3. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
    See citations under working paper version above.
  4. Ivan Balbuzanov, 2019. "Lies and consequences," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(4), pages 1203-1240, December.

    Cited by:

    1. Philippe Jehiel, 2021. "Communication with forgetful liars," PSE-Ecole d'économie de Paris (Postprint) halshs-03229984, HAL.
    2. Chloe Tergiman & Marie Claire Villeval, 2021. "The Way People Lie in Markets: Detectable vs. Deniable Lies," Working Papers halshs-03512300, HAL.
    3. Chloe Tergiman & Marie Claire Villeval, 2019. "The Way People Lie in Markets," Working Papers halshs-02292040, HAL.
    4. Federico Vaccari, 2023. "Influential news and policy-making," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(4), pages 1363-1418, November.
    5. Ian Ball & Deniz Kattwinkel, 2019. "Probabilistic Verification in Mechanism Design," Papers 1908.05556, arXiv.org, revised Dec 2023.
    6. Alessandro Ispano & Peter Vida, 2021. "Designing Interrogations," THEMA Working Papers 2021-02, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    7. Florian Ederer & Weicheng Min, 2021. "Bayesian Persuasion with Lie Detection," Cowles Foundation Discussion Papers 2272, Cowles Foundation for Research in Economics, Yale University.

  5. Ivan Balbuzanov, 2016. "Convex strategyproofness with an application to the probabilistic serial mechanism," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(3), pages 511-520, March.

    Cited by:

    1. 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.
    2. Shichijo, Tatsuhiro & Fukuda, Emiko, 2021. "Cost-sharing mechanism for excludable goods with generalized non-rivalry," Journal of Economic Theory, Elsevier, vol. 193(C).
    3. 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.
    4. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
    5. 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.
    6. Sulagna Dasgupta & Debasis Mishra, 2020. "Ordinal Bayesian incentive compatibility in random assignment model," Papers 2009.13104, arXiv.org, revised May 2021.
    7. Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 2 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-CTA: Contract Theory and Applications (1) 2022-05-23. Author is listed
  2. NEP-DES: Economic Design (1) 2022-05-23. Author is listed
  3. NEP-GTH: Game Theory (1) 2017-04-30. Author is listed
  4. NEP-MIC: Microeconomics (1) 2022-05-23. Author is listed
  5. NEP-SPO: Sports and Economics (1) 2022-05-23. Author is listed

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Ivan Balbuzanov should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.