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

Péter Biró
(Peter Biro)

Personal Details

First Name:Peter
Middle Name:
Last Name:Biro
Suffix:
RePEc Short-ID:pbi196
[This author has chosen not to make the email address public]
https://kti.krtk.hu/en/researchers/peter-biro/

Affiliation

(33%) Döntéselmélet Tanszék
Operáció és Döntés Intézet
Budapesti Corvinus Egyetem

Budapest, Hungary
https://www.uni-corvinus.hu/fooldal/egyetemunkrol/tanszekek/donteselmelet-tanszek/
RePEc:edi:mibkehu (more details at EDIRC)

(67%) Játékelméleti Kutatócsoport
Közgazdaság-tudományi Intézet
Közgazdaság- és Regionális Tudományi Kutatóközpont

Budapest, Hungary
http://econ.core.hu/english/res/game_desc.html
RePEc:edi:jkhashu (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Kutasi Kristóf & Koltai Júlia & Szabó-Morvai Ágnes & Röst Gergely & Karsai Márton & Biró Péter & Lengyel Balázs, 2022. "Understanding hesitancy with revealed preferences across COVID-19 vaccine types," CERS-IE WORKING PAPERS 2207, Institute of Economics, Centre for Economic and Regional Studies.
  2. Haris Aziz & Anton Baychkov & Peter Biro, 2021. "Cutoff stability under distributional constraints with an application to summer internship matching," Papers 2102.02931, arXiv.org, revised Oct 2023.
  3. Péter Biró & Flip Klijn & Szilvia Pápai, 2021. "Serial Rules in a Multi-Unit Shapley-Scarf Market," Working Papers 1255, Barcelona School of Economics.
  4. Péter Biró & Flip Klijn & Xenia Klimentova & Ana Viana, 2021. "Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange," Working Papers 1235, Barcelona School of Economics.
  5. Peter Biro & Jens Gudmundsson, 2020. "Complexity of finding Pareto-efficient allocations of highest welfare," CERS-IE WORKING PAPERS 2016, Institute of Economics, Centre for Economic and Regional Studies.
  6. Laszlo A. Koczy & Peter Biro & Balazs Sziklai, 2017. "US vs. European Apportionment Practices: The Conflict between Monotonicity and Proportionality," CERS-IE WORKING PAPERS 1716, Institute of Economics, Centre for Economic and Regional Studies.
  7. Kolos Csaba Agoston & Peter Biro & Richard Szanto, 2017. "Stable project allocation under distributional constraints," CERS-IE WORKING PAPERS 1733, Institute of Economics, Centre for Economic and Regional Studies.
  8. Kolos Csaba Agoston & Peter Biro & Iain McBride, 2016. "Integer programming methods for special college admissions problems," CERS-IE WORKING PAPERS 1632, Institute of Economics, Centre for Economic and Regional Studies.
  9. Peter Biro & Walter Kern & Daniel Paulusma & Peter Wojuteczky, 2015. "The Stable Fixtures Problem with Payments," CERS-IE WORKING PAPERS 1545, Institute of Economics, Centre for Economic and Regional Studies.
  10. Biró, Péter & Iñarra García, María Elena & Molis Bañales, Elena, 2014. "A new solution for the roommate problem: The Q-stable matchings," IKERLANAK 13424, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.
  11. Peter Biro & Sofya Kiselgof, 2013. "College admissions with stable score-limits," CERS-IE WORKING PAPERS 1306, Institute of Economics, Centre for Economic and Regional Studies.
    • Péter Biró & Sofya Kiselgof, 2015. "College admissions with stable score-limits," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 727-741, December.
  12. Peter Biro & Tamas Fleiner & Rob Irving, 2013. "Matching Couples with Scarf's Algorithm," CERS-IE WORKING PAPERS 1330, Institute of Economics, Centre for Economic and Regional Studies.
  13. Peter Biro & Laszlo A. Koczy & Balazs Sziklai, 2013. "Fair Apportionment in the View of the Venice Commission's Recommendation," CERS-IE WORKING PAPERS 1338, Institute of Economics, Centre for Economic and Regional Studies.
  14. Peter Biro & Matthijs Bomhoff & Walter Kern & Petr A. Golovach & Daniel Paulusma, 2012. "Solutions for the Stable Roommates Problem with Payments," CERS-IE WORKING PAPERS 1211, Institute of Economics, Centre for Economic and Regional Studies.
  15. László Á. Kóczy & Péter Biró & Balázs Sziklai, 2012. "Fair apportionment of voting districts in Hungary?," Working Paper Series 1204, Óbuda University, Keleti Faculty of Business and Management.
  16. Peter Biro & Tamas Fleiner, 2012. "Fractional solutions for capacitated NTU-games, with applications to stable matchings," CERS-IE WORKING PAPERS 1234, Institute of Economics, Centre for Economic and Regional Studies.
  17. Peter Biro & Flip Klijn, 2011. "Matching with Couples: a Multidisciplinary Survey," CERS-IE WORKING PAPERS 1139, Institute of Economics, Centre for Economic and Regional Studies.
  18. Peter Biro & Gethin Norman, 2011. "Analysis of Stochastic Matching Markets," CERS-IE WORKING PAPERS 1132, Institute of Economics, Centre for Economic and Regional Studies.
  19. Peter Biro & Walter Kern & Daniel Paulusma, 2011. "Computing Solutions for Matching Games," CERS-IE WORKING PAPERS 1142, Institute of Economics, Centre for Economic and Regional Studies.

Articles

  1. Lilla Matyasi & Péter Biró, 2024. "Testing re-optimisation strategies in international kidney exchange programmes by the ENCKEP simulator," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 32(4), pages 989-1011, December.
  2. Péter Biró & Sándor Bozóki & Tamás Király & Alexandru Kristály, 2024. "Optimization methods and algorithms," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 32(1), pages 1-9, March.
  3. Biró, Péter & Csáji, Gergely, 2024. "Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains," Games and Economic Behavior, Elsevier, vol. 145(C), pages 217-238.
  4. Botond Bertok & Péter Biró & Marianna E.-Nagy, 2024. "Overview of Hungarian operations research based on the VOCAL 2022 conference," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 32(4), pages 897-902, December.
  5. Kristóf Druzsin & Péter Biró & Xenia Klimentova & Rita Fleiner, 2024. "Performance evaluation of national and international kidney exchange programmes with the ENCKEP simulator," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 32(4), pages 923-943, December.
  6. Klimentova, Xenia & Biró, Péter & Viana, Ana & Costa, Virginia & Pedroso, João Pedro, 2023. "Novel integer programming models for the stable kidney exchange problem," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1391-1407.
  7. Biró, Péter & Gyetvai, Márton, 2023. "Online voluntary mentoring: Optimising the assignment of students and mentors," European Journal of Operational Research, Elsevier, vol. 307(1), pages 392-405.
  8. Ágoston, Kolos Csaba & Biró, Péter & Kováts, Endre & Jankó, Zsuzsanna, 2022. "College admissions with ties and common quotas: Integer programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 722-734.
  9. Biró, Péter & Klijn, Flip & Pápai, Szilvia, 2022. "Serial Rules in a Multi-Unit Shapley-Scarf Market," Games and Economic Behavior, Elsevier, vol. 136(C), pages 428-453.
  10. Péter Biró & Gyula Magyarkuti, 2021. "The Work of Milgrom and Wilson in the Theory and Practical Application of Auctions," Financial and Economic Review, Magyar Nemzeti Bank (Central Bank of Hungary), vol. 20(1), pages 127-151.
  11. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
  12. Biró, Péter & van de Klundert, Joris & Manlove, David & Pettersson, William & Andersson, Tommy & Burnapp, Lisa & Chromy, Pavel & Delgado, Pablo & Dworczak, Piotr & Haase, Bernadette & Hemke, Aline & J, 2021. "Modelling and optimisation in European Kidney Exchange Programmes," European Journal of Operational Research, Elsevier, vol. 291(2), pages 447-456.
  13. Radu-Stefan Mincu & Péter Biró & Márton Gyetvai & Alexandru Popa & Utkarsh Verma, 2021. "IP solutions for international kidney exchange programmes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(2), pages 403-423, June.
  14. Biró, Péter & Kern, Walter & Paulusma, Daniël & Wojuteczky, Péter, 2018. "The stable fixtures problem with payments," Games and Economic Behavior, Elsevier, vol. 108(C), pages 245-268.
  15. Ágoston, Kolos Csaba & Biró, Péter & Szántó, Richárd, 2018. "Stable project allocation under distributional constraints," Operations Research Perspectives, Elsevier, vol. 5(C), pages 59-68.
  16. André Veski & Péter Biró & Kaire Põder & Triin Lauri, 2017. "Efficiency and fair access in Kindergarten allocation policy design," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 57-104, December.
  17. Biró, Péter & Iñarra, Elena & Molis, Elena, 2016. "A new solution concept for the roommate problem: Q-stable matchings," Mathematical Social Sciences, Elsevier, vol. 79(C), pages 74-82.
  18. Kolos Csaba Ágoston & Péter Biró & Iain McBride, 2016. "Integer programming methods for special college admissions problems," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1371-1399, November.
  19. Péter Biró & Sofya Kiselgof, 2015. "College admissions with stable score-limits," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 727-741, December.
  20. Biró, Péter & Kóczy, László Á. & Sziklai, Balázs, 2015. "Fair apportionment in the view of the Venice Commission’s recommendation," Mathematical Social Sciences, Elsevier, vol. 77(C), pages 32-41.
  21. Péter Biró & Gethin Norman, 2013. "Analysis of stochastic matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(4), pages 1021-1040, November.
  22. Péter Biró & Flip Klijn, 2013. "Matching With Couples: A Multidisciplinary Survey," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 15(02), pages 1-18.
  23. Kóczy Á., László & Biró, Péter & Sziklai, Balázs, 2012. "Választókörzetek igazságosan? [Fair apportionment of voting districts in Hungary]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(11), pages 1165-1186.
  24. Péter Biró & Walter Kern & Daniël Paulusma, 2012. "Computing solutions for matching games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 75-90, February.
  25. Biró, Péter, 2011. "A társadalmi döntések számítástudománya - egy új határterület. European Future Technologies Conference and Exhibition (FET'11) COMSOC (Computational Social Choice) szekció MTA Közgazdaságtudományi Int," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(7), pages 709-715.
  26. Péter Biró & Katarína Cechlárová & Tamás Fleiner, 2008. "The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 333-352, 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. Haris Aziz & Anton Baychkov & Peter Biro, 2021. "Cutoff stability under distributional constraints with an application to summer internship matching," Papers 2102.02931, arXiv.org, revised Oct 2023.

    Cited by:

    1. Orhan Aygün & Bertan Turhan, 2023. "How to De-Reserve Reserves: Admissions to Technical Colleges in India," Management Science, INFORMS, vol. 69(10), pages 6147-6164, October.
    2. Aygün, Orhan & Turhan, Bertan, 2021. "How to De-reserve Reserves," ISU General Staff Papers 202104130700001123, Iowa State University, Department of Economics.
    3. Cho, Sung-Ho & Koshimura, Miyuki & Mandal, Pinaki & Yahiro, Kentaro & Yokoo, Makoto, 2022. "Impossibility of weakly stable and strategy-proof mechanism," Economics Letters, Elsevier, vol. 217(C).

  2. Péter Biró & Flip Klijn & Szilvia Pápai, 2021. "Serial Rules in a Multi-Unit Shapley-Scarf Market," Working Papers 1255, Barcelona School of Economics.

    Cited by:

    1. Mih'aly P'eter Hanics, 2022. "Graph theoretical models and algorithms of portfolio compression," Papers 2212.09473, arXiv.org.
    2. Han, Xiang, 2024. "A theory of fair random allocation under priorities," Theoretical Economics, Econometric Society, vol. 19(3), July.

  3. Péter Biró & Flip Klijn & Xenia Klimentova & Ana Viana, 2021. "Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange," Working Papers 1235, Barcelona School of Economics.

    Cited by:

    1. Kratz, Jörgen, 2024. "Conflicting objectives in kidney exchange," Journal of Economic Theory, Elsevier, vol. 217(C).
    2. Afacan, Mustafa Oğuz & Hu, Gaoji & Li, Jiangtao, 2024. "Housing markets since Shapley and Scarf," Journal of Mathematical Economics, Elsevier, vol. 111(C).

  4. Peter Biro & Jens Gudmundsson, 2020. "Complexity of finding Pareto-efficient allocations of highest welfare," CERS-IE WORKING PAPERS 2016, Institute of Economics, Centre for Economic and Regional Studies.

    Cited by:

    1. Eirinakis, Pavlos & Mourtos, Ioannis & Zampou, Eleni, 2022. "Random Serial Dictatorship for horizontal collaboration in logistics," Omega, Elsevier, vol. 111(C).
    2. Kondratev, Aleksei Y. & Nesterov, Alexander S., 2022. "Minimal envy and popular matchings," European Journal of Operational Research, Elsevier, vol. 296(3), pages 776-787.
    3. Aziz, Haris & Huang, Xin & Mattei, Nicholas & Segal-Halevi, Erel, 2023. "Computing welfare-Maximizing fair allocations of indivisible goods," European Journal of Operational Research, Elsevier, vol. 307(2), pages 773-784.
    4. Hai Nguyen & Thành Nguyen & Alexander Teytelboym, 2021. "Stability in Matching Markets with Complex Constraints," Management Science, INFORMS, vol. 67(12), pages 7438-7454, December.
    5. Richárd Kicsiny & Zoltán Varga, 2023. "New algorithm for checking Pareto optimality in bimatrix games," Annals of Operations Research, Springer, vol. 320(1), pages 235-259, January.
    6. Demeulemeester, Tom & Goossens, Dries & Hermans, Ben & Leus, Roel, 2023. "A pessimist’s approach to one-sided matching," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1087-1099.
    7. Dilek Sayedahmed, 2022. "Centralized refugee matching mechanisms with hierarchical priority classes," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 7(1), pages 71-111, December.

  5. Laszlo A. Koczy & Peter Biro & Balazs Sziklai, 2017. "US vs. European Apportionment Practices: The Conflict between Monotonicity and Proportionality," CERS-IE WORKING PAPERS 1716, Institute of Economics, Centre for Economic and Regional Studies.

    Cited by:

    1. Bittó, Virág, 2017. "Az Imperiali és Macau politikai választókörzet-kiosztási módszerek empirikus vizsgálata [Empirical Analysis of the Imperiali and Macau Apportionment Methods]," MPRA Paper 79554, University Library of Munich, Germany.
    2. Laszlo A. Koczy & Balazs Sziklai, 2018. "Bounds on Malapportionment," CERS-IE WORKING PAPERS 1801, Institute of Economics, Centre for Economic and Regional Studies.
    3. Csóka, Péter & Kondor, Gábor, 2019. "Delegációk igazságos kiválasztása társadalmi választások elméletével [Choosing a fair delegation by social choice theory]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(7), pages 771-787.
    4. Pivato, Marcus & Soh, Arnold, 2020. "Weighted representative democracy," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 52-63.
    5. Erel Segal-Halevi & Balázs R. Sziklai, 2019. "Monotonicity and competitive equilibrium in cake-cutting," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(2), pages 363-401, September.

  6. Kolos Csaba Agoston & Peter Biro & Richard Szanto, 2017. "Stable project allocation under distributional constraints," CERS-IE WORKING PAPERS 1733, Institute of Economics, Centre for Economic and Regional Studies.

    Cited by:

    1. P'eter Bir'o & M'arton Gyetvai, 2021. "Online voluntary mentoring: Optimising the assignment of students and mentors," Papers 2102.06671, arXiv.org.
    2. Reischmann, Tobias & Klein, Thilo & Giegerich, Sven, 2021. "An iterative deferred acceptance mechanism for decentralized, fast and fair childcare assignment," ZEW Discussion Papers 21-095, ZEW - Leibniz Centre for European Economic Research.
    3. P'eter Bir'o & Flip Klijn & Xenia Klimentova & Ana Viana, 2021. "Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange," Papers 2102.00167, arXiv.org.
    4. Tobias Reischmann & Thilo Klein & Sven Giegerich, 2021. "A deferred acceptance mechanism for decentralized, fast, and fair childcare assignment," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 6(1), pages 59-100, December.

  7. Kolos Csaba Agoston & Peter Biro & Iain McBride, 2016. "Integer programming methods for special college admissions problems," CERS-IE WORKING PAPERS 1632, Institute of Economics, Centre for Economic and Regional Studies.

    Cited by:

    1. P'eter Bir'o & M'arton Gyetvai, 2021. "Online voluntary mentoring: Optimising the assignment of students and mentors," Papers 2102.06671, arXiv.org.
    2. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    3. P'eter Bir'o & Flip Klijn & Xenia Klimentova & Ana Viana, 2021. "Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange," Papers 2102.00167, arXiv.org.
    4. Kolos Csaba Agoston & Peter Biro & Richard Szanto, 2017. "Stable project allocation under distributional constraints," CERS-IE WORKING PAPERS 1733, Institute of Economics, Centre for Economic and Regional Studies.
    5. Delorme, Maxence & García, Sergio & Gondzio, Jacek & Kalcsics, Jörg & Manlove, David & Pettersson, William, 2019. "Mathematical models for stable matching problems with ties and incomplete lists," European Journal of Operational Research, Elsevier, vol. 277(2), pages 426-441.
    6. Haris Aziz & Anton Baychkov & Peter Biro, 2021. "Cutoff stability under distributional constraints with an application to summer internship matching," Papers 2102.02931, arXiv.org, revised Oct 2023.
    7. Klimentova, Xenia & Biró, Péter & Viana, Ana & Costa, Virginia & Pedroso, João Pedro, 2023. "Novel integer programming models for the stable kidney exchange problem," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1391-1407.
    8. L'aszl'o Csat'o & Csaba T'oth, 2018. "University rankings from the revealed preferences of the applicants," Papers 1810.04087, arXiv.org, revised Feb 2020.
    9. P'eter Bir'o & Avinatan Hassidim & Assaf Romm & Ran I. Shorrer & S'andor S'ov'ag'o, 2020. "The Large Core of College Admission Markets: Theory and Evidence," Papers 2010.08631, arXiv.org, revised Aug 2022.
    10. Biró, Péter & Gyetvai, Márton, 2023. "Online voluntary mentoring: Optimising the assignment of students and mentors," European Journal of Operational Research, Elsevier, vol. 307(1), pages 392-405.
    11. Pitchaya Wiratchotisatian & Hoda Atef Yekta & Andrew C. Trapp, 2022. "Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3325-3343, November.
    12. Ágoston, Kolos Csaba & Biró, Péter & Kováts, Endre & Jankó, Zsuzsanna, 2022. "College admissions with ties and common quotas: Integer programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 722-734.
    13. Csató, László & Tóth, Csaba, 2020. "University rankings from the revealed preferences of the applicants," European Journal of Operational Research, Elsevier, vol. 286(1), pages 309-320.

  8. Peter Biro & Walter Kern & Daniel Paulusma & Peter Wojuteczky, 2015. "The Stable Fixtures Problem with Payments," CERS-IE WORKING PAPERS 1545, Institute of Economics, Centre for Economic and Regional Studies.

    Cited by:

    1. Peter Biro & Walter Kern & Daniel Paulusma & Peter Wojuteczky, 2015. "The Stable Fixtures Problem with Payments," CERS-IE WORKING PAPERS 1545, Institute of Economics, Centre for Economic and Regional Studies.
    2. Han Xiao & Tianhang Lu & Qizhi Fang, 2021. "Approximate Core Allocations for Multiple Partners Matching Games," Papers 2107.01442, arXiv.org, revised Oct 2021.

  9. Biró, Péter & Iñarra García, María Elena & Molis Bañales, Elena, 2014. "A new solution for the roommate problem: The Q-stable matchings," IKERLANAK 13424, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.

    Cited by:

    1. Hirata, Daisuke & 平田, 大祐 & Kasuya, Yusuke & 糟谷, 祐介 & Tomoeda, Kentaro & 友枝, 健太郎, 2020. "Stability against Robust Deviations in the Roommate Problem," Discussion Papers 2020-02, Graduate School of Economics, Hitotsubashi University.
    2. Arnaud Zlatko Dragicevic, 2022. "Exchange Networks with Stochastic Matching," Games, MDPI, vol. 14(1), pages 1-18, December.

  10. Peter Biro & Sofya Kiselgof, 2013. "College admissions with stable score-limits," CERS-IE WORKING PAPERS 1306, Institute of Economics, Centre for Economic and Regional Studies.
    • Péter Biró & Sofya Kiselgof, 2015. "College admissions with stable score-limits," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 727-741, December.

    Cited by:

    1. Kolos Csaba Ágoston & Péter Biró & Iain McBride, 2016. "Integer programming methods for special college admissions problems," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1371-1399, November.
    2. Surender Baswana & Partha Pratim Chakrabarti & Sharat Chandran & Yashodhan Kanoria & Utkarsh Patange, 2019. "Centralized Admissions for Engineering Colleges in India," Interfaces, INFORMS, vol. 49(5), pages 338-354, September.
    3. L'aszl'o Csat'o & Csaba T'oth, 2018. "University rankings from the revealed preferences of the applicants," Papers 1810.04087, arXiv.org, revised Feb 2020.
    4. Agnes Cseh & Klaus Heeger, 2020. "The stable marriage problem with ties and restricted edges," CERS-IE WORKING PAPERS 2007, Institute of Economics, Centre for Economic and Regional Studies.
    5. Ágoston, Kolos Csaba & Biró, Péter & Kováts, Endre & Jankó, Zsuzsanna, 2022. "College admissions with ties and common quotas: Integer programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 722-734.
    6. Peter Biro & Tamas Fleiner & Rob Irving, 2013. "Matching Couples with Scarf's Algorithm," CERS-IE WORKING PAPERS 1330, Institute of Economics, Centre for Economic and Regional Studies.
    7. Agnes Cseh & Attila Juhos, 2020. "Pairwise preferences in the stable marriage problem," CERS-IE WORKING PAPERS 2006, Institute of Economics, Centre for Economic and Regional Studies.
    8. Adam Kapor & Mohit Karnani & Christopher Neilson, 2019. "Negative Externalities of Off Platform Options and the Efficiency of Centralized Assignment Mechanisms," Working Papers 635, Princeton University, Department of Economics, Industrial Relations Section..
    9. Peng Shi, 2022. "Optimal Priority-Based Allocation Mechanisms," Management Science, INFORMS, vol. 68(1), pages 171-188, January.
    10. Katarína Cechlárová & Tamás Fleiner & David Manlove & Iain McBride & Eva Potpinková, 2015. "Modelling practical placement of trainee teachers to schools," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(3), pages 547-562, September.
    11. Ferenc Forgó & László Kóczy & Miklós Pintér, 2015. "Editorial," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 723-725, December.
    12. Csató, László & Tóth, Csaba, 2020. "University rankings from the revealed preferences of the applicants," European Journal of Operational Research, Elsevier, vol. 286(1), pages 309-320.

  11. Peter Biro & Tamas Fleiner & Rob Irving, 2013. "Matching Couples with Scarf's Algorithm," CERS-IE WORKING PAPERS 1330, Institute of Economics, Centre for Economic and Regional Studies.

    Cited by:

    1. Peter Biro & Flip Klijn, 2011. "Matching with Couples: a Multidisciplinary Survey," CERS-IE WORKING PAPERS 1139, Institute of Economics, Centre for Economic and Regional Studies.
    2. Peter Biro & Tamas Fleiner, 2012. "Fractional solutions for capacitated NTU-games, with applications to stable matchings," CERS-IE WORKING PAPERS 1234, Institute of Economics, Centre for Economic and Regional Studies.

  12. Peter Biro & Laszlo A. Koczy & Balazs Sziklai, 2013. "Fair Apportionment in the View of the Venice Commission's Recommendation," CERS-IE WORKING PAPERS 1338, Institute of Economics, Centre for Economic and Regional Studies.

    Cited by:

    1. Bittó, Virág, 2017. "Az Imperiali és Macau politikai választókörzet-kiosztási módszerek empirikus vizsgálata [Empirical Analysis of the Imperiali and Macau Apportionment Methods]," MPRA Paper 79554, University Library of Munich, Germany.
    2. Mithun Chakraborty & Erel Segal-Halevi & Warut Suksompong, 2021. "Weighted Fairness Notions for Indivisible Items Revisited," Papers 2112.04166, arXiv.org, revised Jun 2024.
    3. Balazs R. Sziklai & Karoly Heberger, 2020. "Apportionment and Districting by Sum of Ranking Differences," CERS-IE WORKING PAPERS 2009, Institute of Economics, Centre for Economic and Regional Studies.
    4. Laszlo A. Koczy & Balazs Sziklai, 2018. "Bounds on Malapportionment," CERS-IE WORKING PAPERS 1801, Institute of Economics, Centre for Economic and Regional Studies.
    5. Csóka, Péter & Kondor, Gábor, 2019. "Delegációk igazságos kiválasztása társadalmi választások elméletével [Choosing a fair delegation by social choice theory]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(7), pages 771-787.
    6. Laszlo A. Koczy & Peter Biro & Balazs Sziklai, 2017. "US vs. European Apportionment Practices: The Conflict between Monotonicity and Proportionality," CERS-IE WORKING PAPERS 1716, Institute of Economics, Centre for Economic and Regional Studies.

  13. Peter Biro & Matthijs Bomhoff & Walter Kern & Petr A. Golovach & Daniel Paulusma, 2012. "Solutions for the Stable Roommates Problem with Payments," CERS-IE WORKING PAPERS 1211, Institute of Economics, Centre for Economic and Regional Studies.

    Cited by:

    1. Newton, Jonathan & Sawa, Ryoji, 2015. "A one-shot deviation principle for stability in matching problems," Journal of Economic Theory, Elsevier, vol. 157(C), pages 1-27.
    2. Peter Biro & Gethin Norman, 2011. "Analysis of Stochastic Matching Markets," CERS-IE WORKING PAPERS 1132, Institute of Economics, Centre for Economic and Regional Studies.
    3. Heinrich Nax & Bary Pradelski, 2015. "Evolutionary dynamics and equitable core selection in assignment games," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(4), pages 903-932, November.
    4. Chen, Bo & Fujishige, Satoru & Yang, Zaifu, 2016. "Random decentralized market processes for stable job matchings with competitive salaries," Journal of Economic Theory, Elsevier, vol. 165(C), pages 25-36.
    5. Bolle Friedel & Otto Philipp E., 2016. "Matching as a Stochastic Process," Journal of Economics and Statistics (Jahrbuecher fuer Nationaloekonomie und Statistik), De Gruyter, vol. 236(3), pages 323-348, May.
    6. Bary S. R. Pradelski & Heinrich H. Nax, 2020. "Market sentiments and convergence dynamics in decentralized assignment economies," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(1), pages 275-298, March.
    7. Nax, Heinrich H. & Pradelski, Bary S. R., 2015. "Evolutionary dynamics and equitable core selection in assignment games," LSE Research Online Documents on Economics 65428, London School of Economics and Political Science, LSE Library.
    8. Bettina Klaus & Frédéric Payot, 2013. "Paths to Stability in the Assignment Problem," Cahiers de Recherches Economiques du Département d'économie 13.14, Université de Lausanne, Faculté des HEC, Département d’économie.
    9. Bary S.R. Pradelski, 2014. "Evolutionary Dynamics and Fast Convergence in the Assignment Game," Economics Series Working Papers 700, University of Oxford, Department of Economics.
    10. Ahmet Alkan & Alparslan Tuncay, 2014. "Pairing Games and Markets," Working Papers 2014.48, Fondazione Eni Enrico Mattei.
    11. Satoru Fujishige & Zaifu Yang, 2015. "Decentralised Random Competitive Dynamic Market Processes," Discussion Papers 15/27, Department of Economics, University of York.
    12. Heinrich H. Nax & Bary S. R. Pradelski, 2016. "Core Stability and Core Selection in a Decentralized Labor Matching Market," Games, MDPI, vol. 7(2), pages 1-16, March.

  14. Peter Biro & Tamas Fleiner, 2012. "Fractional solutions for capacitated NTU-games, with applications to stable matchings," CERS-IE WORKING PAPERS 1234, Institute of Economics, Centre for Economic and Regional Studies.

    Cited by:

    1. Thanh Nguyen & Rakesh Vohra, 2014. "Near Feasible Stable Matchings with Complementarities," PIER Working Paper Archive 14-028, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    2. Manjunath, Vikram, 2016. "Fractional matching markets," Games and Economic Behavior, Elsevier, vol. 100(C), pages 321-336.
    3. Peter Biro & Tamas Fleiner & Rob Irving, 2013. "Matching Couples with Scarf's Algorithm," CERS-IE WORKING PAPERS 1330, Institute of Economics, Centre for Economic and Regional Studies.
    4. Ahmet Alkan & Alparslan Tuncay, 2014. "Pairing Games and Markets," Working Papers 2014.48, Fondazione Eni Enrico Mattei.

  15. Peter Biro & Flip Klijn, 2011. "Matching with Couples: a Multidisciplinary Survey," CERS-IE WORKING PAPERS 1139, Institute of Economics, Centre for Economic and Regional Studies.

    Cited by:

    1. Atay, Ata & Funck, Sylvain & Mauleon, Ana & Vannetelbosch, Vincent, 2023. "Matching markets with farsighted couples," LIDAM Discussion Papers CORE 2023011, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Kolos Csaba Ágoston & Péter Biró & Iain McBride, 2016. "Integer programming methods for special college admissions problems," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1371-1399, November.
    3. Kominers, Scott Duke & Teytelboym, Alexander & Crawford, Vincent P, 2017. "An invitation to market design," University of California at San Diego, Economics Working Paper Series qt3xp2110t, Department of Economics, UC San Diego.
    4. Tello, Benjamín, 2023. "Restricted complementarity and paths to stability in matching with couples," Mathematical Social Sciences, Elsevier, vol. 126(C), pages 60-67.
    5. Rashid Farooq & Ayesha Mahmood, 2017. "A Note on a Two-Sided Discrete-Concave Market with Possibly Bounded Salaries," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 19(03), pages 1-21, September.
    6. Thanh Nguyen & Rakesh Vohra, 2014. "Near Feasible Stable Matchings with Complementarities," PIER Working Paper Archive 14-028, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    7. Ágnes Cseh & Brian C. Dean, 2016. "Improved algorithmic results for unsplittable stable allocation problems," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 657-671, October.
    8. Delorme, Maxence & García, Sergio & Gondzio, Jacek & Kalcsics, Joerg & Manlove, David & Pettersson, William, 2021. "Stability in the hospitals/residents problem with couples and ties: Mathematical models and computational studies," Omega, Elsevier, vol. 103(C).
    9. Peter Biro & Sofya Kiselgof, 2013. "College admissions with stable score-limits," CERS-IE WORKING PAPERS 1306, Institute of Economics, Centre for Economic and Regional Studies.
      • Péter Biró & Sofya Kiselgof, 2015. "College admissions with stable score-limits," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 727-741, December.
    10. Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'économie 14.07, Université de Lausanne, Faculté des HEC, Département d’économie.
    11. Peter Biro & Tamas Fleiner & Rob Irving, 2013. "Matching Couples with Scarf's Algorithm," CERS-IE WORKING PAPERS 1330, Institute of Economics, Centre for Economic and Regional Studies.
    12. Peter Biro & Tamas Fleiner, 2012. "Fractional solutions for capacitated NTU-games, with applications to stable matchings," CERS-IE WORKING PAPERS 1234, Institute of Economics, Centre for Economic and Regional Studies.
    13. Benjamín Tello, 2023. "Restricted Complementarity and Paths to Stability in Matching with Couples," CEMLA Working Paper Series 02/2023, CEMLA.
    14. Katarína Cechlárová & Tamás Fleiner & David Manlove & Iain McBride & Eva Potpinková, 2015. "Modelling practical placement of trainee teachers to schools," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(3), pages 547-562, September.

  16. Peter Biro & Gethin Norman, 2011. "Analysis of Stochastic Matching Markets," CERS-IE WORKING PAPERS 1132, Institute of Economics, Centre for Economic and Regional Studies.

    Cited by:

    1. Jacob D Leshno & Bary S R Pradelski, 2021. "The importance of memory for price discovery in decentralized markets," Post-Print hal-03100097, HAL.
    2. Joana Pais & Ágnes Pintér & Róbert F. Veszteg, 2020. "Decentralized matching markets with(out) frictions: a laboratory experiment," Experimental Economics, Springer;Economic Science Association, vol. 23(1), pages 212-239, March.
    3. Newton, Jonathan & Sawa, Ryoji, 2015. "A one-shot deviation principle for stability in matching problems," Journal of Economic Theory, Elsevier, vol. 157(C), pages 1-27.
    4. Bolle Friedel & Otto Philipp E., 2016. "Matching as a Stochastic Process," Journal of Economics and Statistics (Jahrbuecher fuer Nationaloekonomie und Statistik), De Gruyter, vol. 236(3), pages 323-348, May.
    5. Leshno, Jacob D. & Pradelski, Bary S.R., 2021. "The importance of memory for price discovery in decentralized markets," Games and Economic Behavior, Elsevier, vol. 125(C), pages 62-78.

  17. Peter Biro & Walter Kern & Daniel Paulusma, 2011. "Computing Solutions for Matching Games," CERS-IE WORKING PAPERS 1142, Institute of Economics, Centre for Economic and Regional Studies.

    Cited by:

    1. Frits Hof & Walter Kern & Sascha Kurz & Kanstantsin Pashkovich & Daniël Paulusma, 2020. "Simple games versus weighted voting games: bounding the critical threshold value," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(4), pages 609-621, April.
    2. Peter Biro & Matthijs Bomhoff & Walter Kern & Petr A. Golovach & Daniel Paulusma, 2012. "Solutions for the Stable Roommates Problem with Payments," CERS-IE WORKING PAPERS 1211, Institute of Economics, Centre for Economic and Regional Studies.
    3. Vijay V. Vazirani, 2022. "New Characterizations of Core Imputations of Matching and $b$-Matching Games," Papers 2202.00619, arXiv.org, revised Dec 2022.
    4. Peter Biro & Walter Kern & Daniel Paulusma & Peter Wojuteczky, 2015. "The Stable Fixtures Problem with Payments," CERS-IE WORKING PAPERS 1545, Institute of Economics, Centre for Economic and Regional Studies.
    5. Vijay V. Vazirani, 2022. "Cores of Games via Total Dual Integrality, with Applications to Perfect Graphs and Polymatroids," Papers 2209.04903, arXiv.org, revised Nov 2022.
    6. Akiyoshi Shioura, 2017. "On the Partnership formation problem," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 105-140, December.
    7. Han Xiao & Qizhi Fang, 2022. "Population monotonicity in matching games," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 699-709, May.
    8. Vijay V. Vazirani, 2023. "The Investment Management Game: Extending the Scope of the Notion of Core," Papers 2302.00608, arXiv.org, revised Sep 2023.
    9. Vazirani, Vijay V., 2022. "The general graph matching game: Approximate core," Games and Economic Behavior, Elsevier, vol. 132(C), pages 478-486.
    10. F.Javier Martínez-de-Albéniz & Carles Rafels & Neus Ybern, 2015. "Insights into the nucleolus of the assignment game," UB School of Economics Working Papers 2015/333, University of Barcelona School of Economics.
    11. Vijay V. Vazirani, 2021. "The General Graph Matching Game: Approximate Core," Papers 2101.07390, arXiv.org, revised Jul 2021.
    12. Vijay V. Vazirani, 2023. "LP-Duality Theory and the Cores of Games," Papers 2302.07627, arXiv.org, revised Mar 2023.
    13. Han Xiao & Tianhang Lu & Qizhi Fang, 2021. "Approximate Core Allocations for Multiple Partners Matching Games," Papers 2107.01442, arXiv.org, revised Oct 2021.

Articles

  1. Klimentova, Xenia & Biró, Péter & Viana, Ana & Costa, Virginia & Pedroso, João Pedro, 2023. "Novel integer programming models for the stable kidney exchange problem," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1391-1407.

    Cited by:

    1. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).

  2. Biró, Péter & Klijn, Flip & Pápai, Szilvia, 2022. "Serial Rules in a Multi-Unit Shapley-Scarf Market," Games and Economic Behavior, Elsevier, vol. 136(C), pages 428-453.
    See citations under working paper version above.
  3. Péter Biró & Gyula Magyarkuti, 2021. "The Work of Milgrom and Wilson in the Theory and Practical Application of Auctions," Financial and Economic Review, Magyar Nemzeti Bank (Central Bank of Hungary), vol. 20(1), pages 127-151.

    Cited by:

    1. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    2. Zoltan Hermann & Hedvig Horvath & Attila Lindner, 2022. "Answering Causal Questions Using Observational Data - Achievements of the 2021 Nobel Laureates in Economics," Financial and Economic Review, Magyar Nemzeti Bank (Central Bank of Hungary), vol. 21(1), pages 141-163.

  4. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    See citations under working paper version above.
  5. Biró, Péter & van de Klundert, Joris & Manlove, David & Pettersson, William & Andersson, Tommy & Burnapp, Lisa & Chromy, Pavel & Delgado, Pablo & Dworczak, Piotr & Haase, Bernadette & Hemke, Aline & J, 2021. "Modelling and optimisation in European Kidney Exchange Programmes," European Journal of Operational Research, Elsevier, vol. 291(2), pages 447-456.

    Cited by:

    1. Heo, Eun Jeong & Hong, Sunghoon & Chun, Youngsub, 2022. "Efficient use of immunosuppressants for kidney transplants," Journal of Health Economics, Elsevier, vol. 85(C).
    2. Kratz, Jörgen, 2024. "Conflicting objectives in kidney exchange," Journal of Economic Theory, Elsevier, vol. 217(C).
    3. Perach, Nitsan & Anily, Shoshana, 2022. "Stable matching of student-groups to dormitories," European Journal of Operational Research, Elsevier, vol. 302(1), pages 50-61.
    4. Yu, Haiyan & Yang, Ching-Chi & Yu, Ping, 2023. "Constrained optimization for stratified treatment rules in reducing hospital readmission rates of diabetic patients," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1355-1364.
    5. Maximilian Kasy & Alexander Teytelboym, 2023. "Matching with semi-bandits," The Econometrics Journal, Royal Economic Society, vol. 26(1), pages 45-66.
    6. Biró, Péter & Gyetvai, Márton, 2023. "Online voluntary mentoring: Optimising the assignment of students and mentors," European Journal of Operational Research, Elsevier, vol. 307(1), pages 392-405.

  6. Radu-Stefan Mincu & Péter Biró & Márton Gyetvai & Alexandru Popa & Utkarsh Verma, 2021. "IP solutions for international kidney exchange programmes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(2), pages 403-423, June.

    Cited by:

    1. Carvalho, Margarida & Lodi, Andrea, 2023. "A theoretical and computational equilibria analysis of a multi-player kidney exchange program," European Journal of Operational Research, Elsevier, vol. 305(1), pages 373-385.
    2. Blom, Danny & Smeulders, Bart & Spieksma, Frits, 2024. "Rejection-proof mechanisms for multi-agent kidney exchange," Games and Economic Behavior, Elsevier, vol. 143(C), pages 25-50.
    3. Botond Bertók & Tibor Csendes & Gábor Galambos, 2021. "Operations research in Hungary: VOCAL 2018," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(2), pages 379-386, June.

  7. Biró, Péter & Kern, Walter & Paulusma, Daniël & Wojuteczky, Péter, 2018. "The stable fixtures problem with payments," Games and Economic Behavior, Elsevier, vol. 108(C), pages 245-268.
    See citations under working paper version above.
  8. Ágoston, Kolos Csaba & Biró, Péter & Szántó, Richárd, 2018. "Stable project allocation under distributional constraints," Operations Research Perspectives, Elsevier, vol. 5(C), pages 59-68.
    See citations under working paper version above.
  9. André Veski & Péter Biró & Kaire Põder & Triin Lauri, 2017. "Efficiency and fair access in Kindergarten allocation policy design," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 57-104, December.

    Cited by:

    1. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    2. Reischmann, Tobias & Klein, Thilo & Giegerich, Sven, 2021. "An iterative deferred acceptance mechanism for decentralized, fast and fair childcare assignment," ZEW Discussion Papers 21-095, ZEW - Leibniz Centre for European Economic Research.
    3. Hai Nguyen & Thành Nguyen & Alexander Teytelboym, 2021. "Stability in Matching Markets with Complex Constraints," Management Science, INFORMS, vol. 67(12), pages 7438-7454, December.
    4. Tobias Reischmann & Thilo Klein & Sven Giegerich, 2021. "A deferred acceptance mechanism for decentralized, fast, and fair childcare assignment," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 6(1), pages 59-100, December.
    5. Britta Hoyer & Nadja Stroh-Maraun, 2020. "Stability in Weighted College Admissions Problems," Working Papers Dissertations 63, Paderborn University, Faculty of Business Administration and Economics.

  10. Biró, Péter & Iñarra, Elena & Molis, Elena, 2016. "A new solution concept for the roommate problem: Q-stable matchings," Mathematical Social Sciences, Elsevier, vol. 79(C), pages 74-82.

    Cited by:

    1. Atay, Ata & Mauleon, Ana & Vannetelbosch, Vincent, 2021. "A bargaining set for roommate problems," Journal of Mathematical Economics, Elsevier, vol. 94(C).
    2. Hirata, Daisuke & 平田, 大祐 & Kasuya, Yusuke & 糟谷, 祐介 & Tomoeda, Kentaro & 友枝, 健太郎, 2020. "Stability against Robust Deviations in the Roommate Problem," Discussion Papers 2020-02, Graduate School of Economics, Hitotsubashi University.
    3. Hirata, Daisuke & Kasuya, Yusuke & Tomoeda, Kentaro, 2023. "Weak stability against robust deviations and the bargaining set in the roommate problem," Journal of Mathematical Economics, Elsevier, vol. 105(C).

  11. Kolos Csaba Ágoston & Péter Biró & Iain McBride, 2016. "Integer programming methods for special college admissions problems," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1371-1399, November.
    See citations under working paper version above.
  12. Péter Biró & Sofya Kiselgof, 2015. "College admissions with stable score-limits," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 727-741, December.
    See citations under working paper version above.
  13. Biró, Péter & Kóczy, László Á. & Sziklai, Balázs, 2015. "Fair apportionment in the view of the Venice Commission’s recommendation," Mathematical Social Sciences, Elsevier, vol. 77(C), pages 32-41.
    See citations under working paper version above.
  14. Péter Biró & Gethin Norman, 2013. "Analysis of stochastic matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(4), pages 1021-1040, November.
    See citations under working paper version above.
  15. Péter Biró & Flip Klijn, 2013. "Matching With Couples: A Multidisciplinary Survey," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 15(02), pages 1-18.
    See citations under working paper version above.
  16. Kóczy Á., László & Biró, Péter & Sziklai, Balázs, 2012. "Választókörzetek igazságosan? [Fair apportionment of voting districts in Hungary]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(11), pages 1165-1186.

    Cited by:

    1. Biró, Péter & Kóczy, László Á. & Sziklai, Balázs, 2015. "Fair apportionment in the view of the Venice Commission’s recommendation," Mathematical Social Sciences, Elsevier, vol. 77(C), pages 32-41.
    2. Bittó, Virág, 2017. "Az Imperiali és Macau politikai választókörzet-kiosztási módszerek empirikus vizsgálata [Empirical Analysis of the Imperiali and Macau Apportionment Methods]," MPRA Paper 79554, University Library of Munich, Germany.
    3. Csóka, Péter & Kondor, Gábor, 2019. "Delegációk igazságos kiválasztása társadalmi választások elméletével [Choosing a fair delegation by social choice theory]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(7), pages 771-787.
    4. Laszlo A. Koczy & Peter Biro & Balazs Sziklai, 2017. "US vs. European Apportionment Practices: The Conflict between Monotonicity and Proportionality," CERS-IE WORKING PAPERS 1716, Institute of Economics, Centre for Economic and Regional Studies.

  17. Péter Biró & Walter Kern & Daniël Paulusma, 2012. "Computing solutions for matching games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 75-90, February.
    See citations under working paper version above.
  18. Péter Biró & Katarína Cechlárová & Tamás Fleiner, 2008. "The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 333-352, March.

    Cited by:

    1. Michelle Avataneo & Bertan Turhan, 2020. "Slot-specific Priorities with Capacity Transfers," Papers 2004.13265, arXiv.org, revised Sep 2020.
    2. Simon Mauras, 2020. "Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures," Papers 2005.08584, arXiv.org.
    3. Peter Biro & Gethin Norman, 2011. "Analysis of Stochastic Matching Markets," CERS-IE WORKING PAPERS 1132, Institute of Economics, Centre for Economic and Regional Studies.
    4. Biró, Péter & Iñarra García, María Elena & Molis Bañales, Elena, 2014. "A new solution for the roommate problem: The Q-stable matchings," IKERLANAK 13424, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.
    5. Biró, Péter & Iñarra, Elena & Molis, Elena, 2016. "A new solution concept for the roommate problem: Q-stable matchings," Mathematical Social Sciences, Elsevier, vol. 79(C), pages 74-82.
    6. Iñarra, E. & Larrea, C. & Molis, E., 2013. "Absorbing sets in roommate problems," Games and Economic Behavior, Elsevier, vol. 81(C), pages 165-178.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

Featured entries

This author is featured on the following reading lists, publication compilations, Wikipedia, or ReplicationWiki entries:
  1. IEHAS Research Group on Game Theory

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 19 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-GTH: Game Theory (12) 2011-11-14 2011-11-14 2012-06-13 2012-06-13 2013-10-18 2013-11-09 2014-10-13 2014-11-17 2015-01-26 2015-02-11 2015-11-21 2017-08-06. Author is listed
  2. NEP-CDM: Collective Decision-Making (4) 2012-10-13 2013-11-09 2015-01-26 2017-08-06
  3. NEP-DES: Economic Design (4) 2020-04-27 2021-03-08 2021-04-12 2021-05-24
  4. NEP-CMP: Computational Economics (3) 2012-06-13 2017-01-08 2020-04-27
  5. NEP-POL: Positive Political Economics (3) 2012-10-13 2015-01-26 2017-08-06
  6. NEP-HPE: History and Philosophy of Economics (2) 2011-11-14 2012-06-13
  7. NEP-ORE: Operations Research (2) 2020-04-27 2021-05-24
  8. NEP-EDU: Education (1) 2017-01-08
  9. NEP-HEA: Health Economics (1) 2022-04-18

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, Peter Biro
(Peter Biro) 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.