Last updated: 17 September 2016. A recent CV of mine is available here.
Hungarian Academy of Sciences, Momentum grant, project on Mechanism Design 2016-
Our Mechanism Design research group at the Institute of Economics has started in 2016 July.
COST project on Kidney Exchange Programs
A COST Action on Kidney Exchange Programs is running between 2016 and 2010. I am the head of WG1, which works on the description an analysis of the current practices in Europe.
COST project on Computational Social Choice
A four-year COST Action on Computational Social Choice started in November 2012. One of the four working groups is on matching, that I chair. We organised the first summer school in Hungary in 2013 on matchings, see below at conferences.
Matching in Practice network
Together with Estelle Cantillon and Dorothea Kuebler we form the executive committee of the European research network on Matching in Practice. Besides having workshops in every six months, we have launched a new website, mainly for publishing descriptions on applications in four areas: primary and secondary school choice programs, higher education matching schemes, resident allocations.
An Estonian project: Efficiency and equity in matching pre-schools and children: mechanism design approach (2014-2016)
I was glad to be involved as a mechanism designer in this interdisciplinary project , that investigates the effects of childcare allocation mechanisms on gender inequality.
Applications website(s)
With my colleagues in Glasgow, we created an applications website to collect matching applications with references, links and descriptions written by "local experts" (an updated clone of which has also appeared at my new workplace later).
Workshop on Matching Under Preferences
In the Steering committee of the Match-UP workshops.
Involvement in conference organisation
- The 12th Workshop on Matching in Practice, 15 December 2016, Budapest - member of the organising committee
- 100 Years of Matching Theory in Hungary, 14 December 2016, Budapest - member of the organising committee
- Workshop on Future Directions in Computational Social Choice: the last worshop of the IC1205 COST Action on Computational Social Choice, 21-22 November 2016, Budapest - member of the organising committee
- Summer school on matching problems, markets and mechanisms: the first summer school of the IC1205 COST Action on Computational Social Choice, 24-28 June 2013, Budapest - member of the organising committee, local organiser
- MATCH-UP 2012, The Second International Workshop on Matching Under Preferences, 19-20 July 2012, Budapest - member of the organising committee, local organiser, PC-chair
- The Third Workshop on Matching in Practice, 28 November 2011, Budapest - member of the organising committee, local organiser
- COMSOC workshop, an informal workshop on Computational Social Choice, 3 May 2011, Budapest - organiser
Further PC memberships
2016: SCW-2016, COMSOC-2016, CoopMAS-2016, EXPLORE-2016
2015: MATCH-UP 2015 (co-chair), 5nd Workshop of the IC1205 COST Action on Computational Social Choice, CoopMAS-2015, EXPLORE-2015
2014: CoopMAS-2014, SCW-2014
2013: CoopMAS-2013 , 2nd Workshop of the IC1205 COST Action on Computational Social Choice, 5th Workshop on Matching in Practice
2012: AAMAS-2012 , 4th Workshop on Matching in Practice, SING8, Frontiers in Market Design: Matching Markets
2011: 2nd Workshop on Matching in Practice
Editorial work
Journal papers
- Integer programming methods for special college admissions problems, with Kolos Csaba Ágoston and Iain McBride To appear in Journal of Combinatorial Optimization
An earlier version appeared in the Proceedings of COCOA 2014: the 8th Annual International Conference on Combinatorial Optimization and Applications, volume 8881 of Lecture Notes in Computer Science, pages 429-443, Springer, 2014
The full version of this paper is available as Technical Report no. 1408.6878, Computing Research Repository, Cornell University Library, 2014.
- Fractional solutions for NTU-games, with applications to stable matchings, with Tamás Fleiner. To appear in Discrete Optimization.
An earlier version appeared in the proceedings of COMSOC 2010: 3rd International Workshop on Computational Social Choice, pp. 283-294 (2010). (The corresponding Technical Report is available here.) An extended Discussion Paper from 2012 can be found here.
- A new solution for the roommate problem: The Q-stable matchings, with Elena Inarra and Elena Molis. Mathematical Social Sciences 79, 74-82 (2016).
The corresponding Discussion Paper is available here.
- Matching couples with Scarf's algorithm, with Tamás Fleiner and Rob Irving. Annals of Mathematics and Artificial Intelligence 77(3). 303-316 (2016)
An earlier version appeared in the Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, pp. 55-64 (2013). The corresponding Discussion Paper is available here.
- Fair Apportionment in the View of the Venice Commission's Recommendation, with László Á. Kóczy and Balázs Sziklai. Mathematical Social Sciences 77, 32-41 (2015).
The corresponding Discussion Paper is available here.
- College admissions with stable score-limits, with Sofya Kiselgof. Central European Journal of Operations Research 23(4), 727-741 (2015).
It was presented at GAMES 2012 and COMSOC 2012. The corresponding Discussion Paper is available here.
- Solutions for the Stable Roommates Problem with Payments, with Matthijs Bomhoff, Petr A. Golovach, Walter Kern and Daniel Paulusma. Theoretical Computer Science 540-541, 53-61 (2014).
An earlier version appeared in the proceedings of WG 2012: 38th International Workshop on Graph Theoretic
Concepts in Computer Science (2012). The corresponding Discussion Paper is available here.
- Matching with sizes (or scheduling with processing set restrictions), with Eric McDermid. Discrete Applied Mathematics 164(1), 61-67 (2014).
An earlier version of this paper appeared in the Proceedings of ISCO: International Symposium on Combinatorial Optimization, volume 36 of Electronic Notes on Discrete Mathematics, pp. 335-342, Elsevier (2010). The corresponding Technical Report is available here.
- Analysis of Stochastic Matching Markets, with Gethin Norman. International Journal of Game Theory, 42, 1021-1040 (2013).
The corresponding Discussion Paper is available here.
The experiments obtained with PRISM can be found in the collection of case studies in the PRISM webpage.
- Matching with Couples: a Multidisciplinary Survey, with Flip Klijn. International Game Theory Review 15(2), 1340008 (2013).
The corresponding Discussion Paper is available here.
- "Almost stable" matchings in the Roommates problem with bounded preference lists , with David Manlove and Eric McDermid. Theoretical Computer Science 432, 10-20 (2012).
The corresponding Technical Report is available here.
- Computing solutions for matching games, with Walter Kern and Daniel Paulusma. International Journal of Game Theory 41(1), 75-90 (2012).
An earlier version of this paper appeared in the Proceedings of TAMC 2010: the 7th Annual Conference on Theory and Applications of Models of Computation, volume 6108 of Lecture Notes in Computer Science, pp. 117-127, Springer (2010). The corresponding Discussion Paper is available here.
- Stable matching with couples: An empirical study, with Rob Irving and Ildikó Schlotter. ACM Journal of Experimental Algorithmics 16, Article No.: 1.2 (2011).
The corresponding Technical Report is available here.
- The College Admissions problem with lower and common quotas, with Tamás Fleiner, Rob Irving and David Manlove. Theoretical Computer Science 411, 3136-3153 (2010).
The full version of this paper is available as Technical Report no. TR-2009-303 of the Computing Science Department of Glasgow University, 2009.
- The Integral Stable Allocation Problem on Graphs, with Tamás Fleiner. Discrete Optimization 7(1-2), 64-73 (2010).
The full version of this paper is available as Technical Report no. TR-2010-312 of the Computing Science Department of Glasgow University, 2010.
- Size versus stability in the Marriage problem, with David Manlove and Shubham Mittal. Theoretical Computer Science 411, 1828-1841 (2010).
An earlier version of this paper appeared in the Proceedings of WAOA 2008: the 6th Workshop on Approximation and Online Algorithms, volume 5426 of Lecture Notes in Computer Science, pages 15-28, Springer-Verlag, 2009. The full version of this paper is available as Technical Report no. TR-2009-297 of the Computing Science Department of Glasgow University, 2009.
- Three-sided stable matchings with cyclic preferences, with Eric McDermid. Algorithmica 58, 5-18 (2010).
An earlier version of this paper appeared in the Proceedings of COMSOC 2008: 2nd International Workshop on Computational Social Choice, Liverpool, 2008; and also in the Proceedings of Match-UP 2008: Workshop on Matching Under Preferences -- Algorithms and Complexity, held at ICALP 2008.
- Maximum weight cycle packing in directed graphs, with application to kidney exchange programs, with David Manlove and Romeo Rizzi. Discrete Mathematics, Algorithms and Applications 1(4), 499-517 (2009).
An earlier version of this paper is available as Technical Report no. TR-2009-298, Department of Computing Science, University of Glasgow, 2009.
- The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems, with Katarína Cechlárová and Tamás Fleiner. International Journal of Game Theory 36, 333-352 (2008).
- Inapproximability of the kidney exchange problem, with Katarína Cechlárová. Information Processing Letters 101, 199-202 (2007).
Preprint
Further conference papers
- Stable Matching with Uncertain Linear Preferences, with Haris Aziz, Serge Gaspers, Ronald de Haan, Nicholas Mattei and Baharak Rastegari. To appear in the Proceedings of SAGT 2016.
The full version of this paper is available as Technical Report no. 1607.02917, Computing Research Repository, Cornell University Library, 2016.
- Optimal Reallocation under Additive and Ordinal Preferences, with Haris Aziz, Jérôme Lang, Julien Lesca and Jérôme Monnot. To appear in the Proceedings of AAMAS 2016.
- Stable Fixtures Problem with Payments, with Walter Kern, Daniel Paulusma and Péter Wojuteczky. In the Proceedings of WG 2015: the 41th International Workshop on Graph-Theoretic Concepts in Computer Science, volume 9224 Lecture Notes in Computer Science, pages 49-63.
The full version of this paper is available as Technical Report no. 1508.06420, Computing Research Repository, Cornell University Library, 2015, and also as a Discussion Paper.
- The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models, with David Manlove and Iain McBride In Proceedings of SEA 2014: the 13th International Symposium on Experimental Algorithms, volume 8504 of Lecture Notes in Computer Science, pages 10-21, Springer, 2014
The full version of this paper is available as Technical Report no. 1308.4534, Computing Research Repository, Cornell University Library, 2014.
- Popular matchings in the Marriage and Roommates problems, with Rob Irving and David Manlove. In Proceedings of CIAC 2010: the 7th International Conference on Algorithms and Complexity, volume 6078 of Lecture Notes in Computer Science, pp. 97-108, Springer (2010).
The corresponding Technical Report is available here.
- Higher Education Admission in Hungary by a Score-limit Algorithm. The 18th International Conference on Game Theory at Stony Brook University, (2007).
- Stable exchange of indivisible goods with restrictions. In the Proceedings of the 5th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, pp. 97-105 (2007).
- "Almost stable" matchings in the Roommates problem, with David Abraham and
David Manlove. In Proceedings of WAOA 2005: the 3rd Workshop on Approximation and Online Algorithms, volume 3879 of Lecture Notes in Computer Science, pp. 1-14, Springer-Verlag (2006).
The corresponding Technical Report is available here.
Other papers in submission
- Efficiency and fair access in kindergarten allocation policy design, with André Veski, Kaire Pöder and Triin Lauri.
Other papers in preparation
- Circulation under Responsive Preferences, with Flip Klijn and Szilvia Papai.
- Stable Matching with Uncertain Pairwise Preferences, with Haris Aziz, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei and Baharak Rastegari.
- Stable project allocation under constraints, with Kolos Csaba Ágoston and Richárd Szántó.
Further technical reports (not published elsewhere)
PhD dissertation
MSc theses (in Hungarian)
- Stabil párosítások gazdasági alkalmazásai. Diplomamunka, Corvinus Egyetem, közgazdász szak, 2006.
("Stable matchings and its
applications in economics", Master's thesis in Economic Science, Corvinus University, Hungary.)
- Stabil b-párosítás gráfokon. Diplomamunka, BME, matematikus szak, 2003.
("Stable b-matchings on graphs", Master's thesis in Mathematics, Budapest University of Technology and Economics, Hungary.)
Other papers (in Hungarian)
- Közgazdasági Nobel-emlékdíj 2012: Alvin E. Roth és Lloyd S. Shapley with Péter Csóka, László Á. Kóczy, Ráhel Anna Radványi and Balázs Sziklai. Magyar Tudomány,
174(2), p: 190-199, 2013.
("2012 Nobel Memorial Prize in Economic Sciences: Alvin E. Roth and Lloyd S. Shapley")
- Választókörzetek igazságosan? with László Á. Kóczy and Balázs Sziklai. Közgazdasági Szemle,
LIX. évf., 2012. november (1165—1186. o.), Tanulmány.
("Fair apportionment?")
- A társadalmi döntések számítástudománya - egy új határterület. Közgazdasági Szemle,
LVIII. évf., 2011. július-augusztus (709—715. o.), Tudományos tájékoztató.
("Computational Social Choice - a new interdisciplinary area")
- Stabil párosítási modellek és ezeken alapuló központi párosító programok. Szigma,
XXXVII. (3-4) p:153-175, 2006.
("Stable matching models and corresponding centralised matching schemes")
- Elosztott frekvenciakiosztási algoritmusok tervezése és vizsgálata. with Krisztina Lója and Márton Sütő. Hiradátechnika, LVII. (3) p:43-48, 2002.
(English summary: "Development and Analysis of Local Frequency Assignment Algorithms")
I have joint works with
Useful links