Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPéter Biró 0001
Person information
- affiliation: Corvinus University of Budapest, Institute of Operations and Decision Sciences, Department of Operations Research and Actuarial Sciences, Hungary
- affiliation: HUN-REN Institute of Economics, Centre for Economic and Regional Studies (HUN-REN KRTK), Budapest, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j38]Péter Biró, Sándor Bozóki
, Tamás Király, Alexandru Kristály:
Optimization methods and algorithms. Central Eur. J. Oper. Res. 32(1): 1-9 (2024)- [j37]Haris Aziz, Anton Baychkov, Péter Biró:
Cutoff stability under distributional constraints with an application to summer internship matching. Math. Program. 203(1): 247-269 (2024) - [c22]Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye:
Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. AAMAS 2024: 2153-2155 - 2023
- [j36]Péter Biró, Márton Gyetvai:
Online voluntary mentoring: Optimising the assignment of students and mentors. Eur. J. Oper. Res. 307(1): 392-405 (2023) - [j35]Xenia Klimentova, Péter Biró, Ana Viana, Virginia Costa, João Pedro Pedroso:
Novel integer programming models for the stable kidney exchange problem. Eur. J. Oper. Res. 307(3): 1391-1407 (2023) - [j34]Márton Benedek, Péter Biró, Matthew Johnson, Daniël Paulusma, Xin Ye:
The Complexity of Matching Games: A Survey. J. Artif. Intell. Res. 77: 459-485 (2023) - [i16]Márton Benedek, Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma:
Partitioned Matching Games for International Kidney Exchange. CoRR abs/2301.13181 (2023) - [i15]Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye:
Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded. CoRR abs/2312.16653 (2023) - 2022
- [j33]Balázs R. Sziklai, Péter Biró, László Csató:
The efficacy of tournament designs. Comput. Oper. Res. 144: 105821 (2022) - [j32]Kolos Csaba Ágoston, Péter Biró, Endre Kováts, Zsuzsanna Jankó:
College admissions with ties and common quotas: Integer programming approach. Eur. J. Oper. Res. 299(2): 722-734 (2022) - [j31]Péter Biró, Flip Klijn, Szilvia Pápai:
Serial Rules in a Multi-Unit Shapley-Scarf Market. Games Econ. Behav. 136: 428-453 (2022) - [j30]Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable matching with uncertain pairwise preferences. Theor. Comput. Sci. 909: 1-11 (2022) - [c21]Haris Aziz, Péter Biró, Makoto Yokoo:
Matching Market Design with Constraints. AAAI 2022: 12308-12316 - [c20]Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma:
Computing Balanced Solutions for Large International Kidney Exchange Schemes. AAMAS 2022: 82-90 - [c19]Péter Biró, Avinatan Hassidim, Assaf Romm, Ran I. Shorrer, Sándor Sovago:
The Large Core of College Admission Markets: Theory and Evidence. EC 2022: 958-959 - [i14]Péter Biró, Gergely Csáji:
Strong core and Pareto-optimal solutions for the multiple partners matching problem under lexicographic preferences. CoRR abs/2202.05484 (2022) - [i13]Márton Benedek, Péter Biró, Matthew Johnson, Daniël Paulusma, Xin Ye:
The Complexity of Matching Games: A Survey. CoRR abs/2202.06898 (2022) - 2021
- [j29]Radu Stefan Mincu, Péter Biró, Márton Gyetvai, Alexandru Popa, Utkarsh Verma:
IP solutions for international kidney exchange programmes. Central Eur. J. Oper. Res. 29(2): 403-423 (2021) - [j28]Péter Biró, Joris van de Klundert, David F. Manlove, William Pettersson, Tommy Andersson, Lisa Burnapp, Pavel Chromy, Pablo Delgado, Piotr Dworczak, Bernadette Haase, Aline Hemke, Rachel Johnson, Xenia Klimentova, Dirk Kuypers, Alessandro Nanni Costa, Bart Smeulders, Frits C. R. Spieksma, María O. Valentín, Ana Viana:
Modelling and optimisation in European Kidney Exchange Programmes. Eur. J. Oper. Res. 291(2): 447-456 (2021) - [j27]Péter Biró, Jens Gudmundsson:
Complexity of finding Pareto-efficient allocations of highest welfare. Eur. J. Oper. Res. 291(2): 614-628 (2021) - [c18]Attila Rusznák, Péter Biró, Rita Fleiner:
Seat transfers in the course allocation mechanism of Eötvös Loránd University. SACI 2021: 503-508 - [c17]Ildikó Schlotter, Péter Biró, Tamás Fleiner:
The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing Up Your Home? WINE 2021: 244-261 - [e2]Péter Biró, Shuchi Chawla, Federico Echenique:
EC '21: The 22nd ACM Conference on Economics and Computation, Budapest, Hungary, July 18-23, 2021. ACM 2021, ISBN 978-1-4503-8554-1 [contents] - [i12]Péter Biró, Flip Klijn, Xenia Klimentova, Ana Viana:
Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange. CoRR abs/2102.00167 (2021) - [i11]Haris Aziz, Anton Baychkov, Péter Biró:
Cutoff stability under distributional constraints with an application to summer internship matching. CoRR abs/2102.02931 (2021) - [i10]Péter Biró, Márton Gyetvai:
Online voluntary mentoring: Optimising the assignment of students and mentors. CoRR abs/2102.06671 (2021) - [i9]Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma:
Computing Balanced Solutions for Large International Kidney Exchange Schemes. CoRR abs/2109.06788 (2021) - [i8]Ildikó Schlotter, Péter Biró, Tamás Fleiner:
The core of housing markets from an agent's perspective: Is it worth sprucing up your home? CoRR abs/2110.06875 (2021) - [i7]Haris Aziz, Péter Biró, Tamás Fleiner, Bettina Klaus:
Matching Under Preferences: Theory and Practice (Dagstuhl Seminar 21301). Dagstuhl Reports 11(6): 124-146 (2021) - 2020
- [j26]Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable Matching with Uncertain Linear Preferences. Algorithmica 82(5): 1410-1433 (2020) - [c16]Haris Aziz, Anton Baychkov, Péter Biró:
Summer Internship Matching with Funding Constraints. AAMAS 2020: 97-104 - [c15]Péter Biró, Márton Gyetvai, Xenia Klimentova, João Pedro Pedroso, William Pettersson, Ana Viana:
Compensation Scheme With Shapley Value For Multi-Country Kidney Exchange Programmes. ECMS 2020: 129-136 - [e1]Péter Biró, Jason D. Hartline, Michael Ostrovsky, Ariel D. Procaccia:
EC '20: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, July 13-17, 2020. ACM 2020, ISBN 978-1-4503-7975-5 [contents] - [i6]Xenia Klimentova, Péter Biró, Ana Viana, Virginia Costa, João Pedro Pedroso:
Novel Integer Programming models for the stable kidney exchange problem. CoRR abs/2012.04918 (2020)
2010 – 2019
- 2019
- [j25]Haris Aziz, Péter Biró, Ronald de Haan, Baharak Rastegari:
Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity. Artif. Intell. 276: 57-78 (2019) - [j24]Haris Aziz, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot:
Efficient reallocation under additive and responsive preferences. Theor. Comput. Sci. 790: 1-15 (2019) - [c14]Haris Aziz, Péter Biró, Ronald de Haan, Baharak Rastegari:
Pareto Optimal Allocation under Compact Uncertain Preferences. AAAI 2019: 1740-1747 - [c13]Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma:
Generalized Matching Games for International Kidney Exchange. AAMAS 2019: 413-421 - 2018
- [j23]Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky:
The stable fixtures problem with payments. Games Econ. Behav. 108: 245-268 (2018) - 2017
- [c12]Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable Matching with Uncertain Pairwise Preferences. AAMAS 2017: 344-352 - [c11]Kolos Csaba Ágoston, Péter Biró:
Modelling Preference Ties And Equal Treatment Policy. ECMS 2017: 516-522 - [i5]Kolos Csaba Ágoston, Péter Biró, Richárd Szántó:
Stable project allocation under distributional constraints. CoRR abs/1711.04484 (2017) - 2016
- [j22]Péter Biró, Tamás Fleiner, Robert W. Irving:
Matching couples with Scarf's algorithm. Ann. Math. Artif. Intell. 77(3-4): 303-316 (2016) - [j21]Péter Biró, Tamás Fleiner:
Fractional solutions for capacitated NTU-games, with applications to stable matchings. Discret. Optim. 22: 241-254 (2016) - [j20]Kolos Csaba Ágoston, Péter Biró, Iain McBride:
Integer programming methods for special college admissions problems. J. Comb. Optim. 32(4): 1371-1399 (2016) - [j19]Péter Biró, María Elena Iñarra García, Elena Molis:
A new solution concept for the roommate problem: Q-stable matchings. Math. Soc. Sci. 79: 74-82 (2016) - [c10]Haris Aziz, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot:
Optimal Reallocation under Additive and Ordinal Preferences. AAMAS 2016: 402-410 - [c9]Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable Matching with Uncertain Linear Preferences. SAGT 2016: 195-206 - [i4]Haris Aziz, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot:
Optimal Reallocation under Additive and Ordinal Preferences. CoRR abs/1604.01091 (2016) - [i3]Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable Matching with Uncertain Linear Preferences. CoRR abs/1607.02917 (2016) - 2015
- [j18]Péter Biró, Sofya G. Kiselgof:
College admissions with stable score-limits. Central Eur. J. Oper. Res. 23(4): 727-741 (2015) - [j17]Péter Biró, László Á. Kóczy, Balázs R. Sziklai:
Fair apportionment in the view of the Venice Commission's recommendation. Math. Soc. Sci. 77: 32-41 (2015) - [c8]Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky:
The Stable Fixtures Problem with Payments. WG 2015: 49-63 - [i2]Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky:
The Stable Fixtures Problem with Payments. CoRR abs/1508.06420 (2015) - 2014
- [j16]Péter Biró, David F. Manlove:
Editorial: Special Issue on Matching under Preferences. Algorithms 7(2): 203-205 (2014) - [j15]Péter Biró, Eric McDermid:
Matching with sizes (or scheduling with processing set restrictions). Discret. Appl. Math. 164: 61-67 (2014) - [j14]Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma:
Solutions for the stable roommates problem with payments. Theor. Comput. Sci. 540: 53-61 (2014) - [c7]Péter Biró, Iain McBride:
Integer Programming Methods for Special College Admissions Problems. COCOA 2014: 429-443 - [c6]Péter Biró, David F. Manlove, Iain McBride:
The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models. SEA 2014: 10-21 - [i1]Péter Biró, Iain McBride:
Integer programming methods for special college admissions problems. CoRR abs/1408.6878 (2014) - 2013
- [j13]Péter Biró, Flip Klijn:
Matching with couples: a Multidisciplinary Survey. IGTR 15(2) (2013) - [j12]Péter Biró, Gethin Norman:
Analysis of stochastic matching markets. Int. J. Game Theory 42(4): 1021-1040 (2013) - 2012
- [j11]Péter Biró, Walter Kern, Daniël Paulusma:
Computing solutions for matching games. Int. J. Game Theory 41(1): 75-90 (2012) - [j10]Péter Biró, David F. Manlove, Eric McDermid:
"Almost stable" matchings in the Roommates problem with bounded preference lists. Theor. Comput. Sci. 432: 10-20 (2012) - [c5]Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma:
Solutions for the Stable Roommates Problem with Payments. WG 2012: 69-80 - 2011
- [j9]Péter Biró, Robert W. Irving, Ildikó Schlotter:
Stable matching with couples: An empirical study. ACM J. Exp. Algorithmics 16 (2011) - 2010
- [j8]Péter Biró, Eric McDermid:
Three-Sided Stable Matchings with Cyclic Preferences. Algorithmica 58(1): 5-18 (2010) - [j7]Péter Biró, Tamás Fleiner:
The integral stable allocation problem on graphs. Discret. Optim. 7(1-2): 64-73 (2010) - [j6]Péter Biró, Eric McDermid:
Matching with sizes (or scheduling with processing set restrictions). Electron. Notes Discret. Math. 36: 335-342 (2010) - [j5]Péter Biró, David F. Manlove, Shubham Mittal:
Size versus stability in the marriage problem. Theor. Comput. Sci. 411(16-18): 1828-1841 (2010) - [j4]Péter Biró, Tamás Fleiner, Robert W. Irving, David F. Manlove:
The College Admissions problem with lower and common quotas. Theor. Comput. Sci. 411(34-36): 3136-3153 (2010) - [c4]Péter Biró, Robert W. Irving, David F. Manlove:
Popular Matchings in the Marriage and Roommates Problems. CIAC 2010: 97-108 - [c3]Péter Biró, Walter Kern, Daniël Paulusma:
On Solution Concepts for Matching Games. TAMC 2010: 117-127
2000 – 2009
- 2009
- [j3]Péter Biró, David F. Manlove, Romeo Rizzi:
Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs. Discret. Math. Algorithms Appl. 1(4): 499-518 (2009) - 2008
- [j2]Péter Biró, Katarína Cechlárová, Tamás Fleiner:
The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems. Int. J. Game Theory 36(3-4): 333-352 (2008) - [c2]Péter Biró, David F. Manlove, Shubham Mittal:
Size Versus Stability in the Marriage Problem. WAOA 2008: 15-28 - 2007
- [j1]Péter Biró, Katarína Cechlárová:
Inapproximability of the kidney exchange problem. Inf. Process. Lett. 101(5): 199-202 (2007) - 2005
- [c1]David J. Abraham, Péter Biró, David F. Manlove:
"Almost Stable" Matchings in the Roommates Problem. WAOA 2005: 1-14
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-05-05 03:01 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:
