Péter Biró

Orcid: 0000-0001-7011-3463

Affiliations:
  • Corvinus University of Budapest, Institute of Operations and Decision Sciences, Department of Operations Research and Actuarial Sciences, Hungary
  • HUN-REN Institute of Economics, Centre for Economic and Regional Studies (HUN-REN KRTK), Budapest, Hungary


According to our database1, Péter Biró authored at least 59 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimization methods and algorithms.
Central Eur. J. Oper. Res., March, 2024

Cutoff stability under distributional constraints with an application to summer internship matching.
Math. Program., January, 2024

2023
Novel integer programming models for the stable kidney exchange problem.
Eur. J. Oper. Res., June, 2023

Online voluntary mentoring: Optimising the assignment of students and mentors.
Eur. J. Oper. Res., May, 2023

The Complexity of Matching Games: A Survey.
J. Artif. Intell. Res., 2023

Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded.
CoRR, 2023

Partitioned Matching Games for International Kidney Exchange.
CoRR, 2023

2022
Stable matching with uncertain pairwise preferences.
Theor. Comput. Sci., 2022

Serial Rules in a Multi-Unit Shapley-Scarf Market.
Games Econ. Behav., 2022

College admissions with ties and common quotas: Integer programming approach.
Eur. J. Oper. Res., 2022

Strong core and Pareto-optimal solutions for the multiple partners matching problem under lexicographic preferences.
CoRR, 2022

The efficacy of tournament designs.
Comput. Oper. Res., 2022

The Large Core of College Admission Markets: Theory and Evidence.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Computing Balanced Solutions for Large International Kidney Exchange Schemes.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Matching Market Design with Constraints.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Modelling and optimisation in European Kidney Exchange Programmes.
Eur. J. Oper. Res., 2021

Complexity of finding Pareto-efficient allocations of highest welfare.
Eur. J. Oper. Res., 2021

Matching Under Preferences: Theory and Practice (Dagstuhl Seminar 21301).
Dagstuhl Reports, 2021

Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange.
CoRR, 2021

IP solutions for international kidney exchange programmes.
Central Eur. J. Oper. Res., 2021

The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing Up Your Home?
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Seat transfers in the course allocation mechanism of Eötvös Loránd University.
Proceedings of the 15th IEEE International Symposium on Applied Computational Intelligence and Informatics, 2021

2020
Stable Matching with Uncertain Linear Preferences.
Algorithmica, 2020

Compensation Scheme With Shapley Value For Multi-Country Kidney Exchange Programmes.
Proceedings of the 34th International ECMS Conference on Modelling and Simulation, 2020

Summer Internship Matching with Funding Constraints.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Efficient reallocation under additive and responsive preferences.
Theor. Comput. Sci., 2019

Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity.
Artif. Intell., 2019

Generalized Matching Games for International Kidney Exchange.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Pareto Optimal Allocation under Compact Uncertain Preferences.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
The stable fixtures problem with payments.
Games Econ. Behav., 2018

2017
Stable project allocation under distributional constraints.
CoRR, 2017

Modelling Preference Ties And Equal Treatment Policy.
Proceedings of the European Conference on Modelling and Simulation, 2017

2016
A new solution concept for the roommate problem: Q-stable matchings.
Math. Soc. Sci., 2016

Integer programming methods for special college admissions problems.
J. Comb. Optim., 2016

Fractional solutions for capacitated NTU-games, with applications to stable matchings.
Discret. Optim., 2016

Matching couples with Scarf's algorithm.
Ann. Math. Artif. Intell., 2016

Optimal Reallocation under Additive and Ordinal Preferences.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Fair apportionment in the view of the Venice Commission's recommendation.
Math. Soc. Sci., 2015

College admissions with stable score-limits.
Central Eur. J. Oper. Res., 2015

2014
Solutions for the stable roommates problem with payments.
Theor. Comput. Sci., 2014

Editorial: Special Issue on Matching under Preferences.
Algorithms, 2014

The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Integer Programming Methods for Special College Admissions Problems.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
Analysis of stochastic matching markets.
Int. J. Game Theory, 2013

Matching with couples: a Multidisciplinary Survey.
IGTR, 2013

2012
"Almost stable" matchings in the Roommates problem with bounded preference lists.
Theor. Comput. Sci., 2012

Computing solutions for matching games.
Int. J. Game Theory, 2012

2011
Stable matching with couples: An empirical study.
ACM J. Exp. Algorithmics, 2011

2010
Size versus stability in the marriage problem.
Theor. Comput. Sci., 2010

The College Admissions problem with lower and common quotas.
Theor. Comput. Sci., 2010

Matching with sizes (or scheduling with processing set restrictions).
Electron. Notes Discret. Math., 2010

The integral stable allocation problem on graphs.
Discret. Optim., 2010

Three-Sided Stable Matchings with Cyclic Preferences.
Algorithmica, 2010

On Solution Concepts for Matching Games.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Popular Matchings in the Marriage and Roommates Problems.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs.
Discret. Math. Algorithms Appl., 2009

2008
The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems.
Int. J. Game Theory, 2008

2007
Inapproximability of the kidney exchange problem.
Inf. Process. Lett., 2007

2005
"Almost Stable" Matchings in the Roommates Problem.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005


  Loading...