Team > Dr. Ágnes Cseh

Fakultät für Mathematik, Physik und Informatik
Mathematisches Institut

Publikationen

2023

Artikel

Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kireš, Lukáš Miňo: A quest for a fair schedule : The International Young Physicists' Tournament. In: Journal of Scheduling, 26 (2023). - S. 3-18.
doi:10.1007/s10951-022-00752-8

Ágnes Cseh, Guillaume Escamocher, Luis Quesada: Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. In: Constraints, 28 (2023). - S. 138-165.
doi:10.1007/s10601-023-09346-3

Sonja Kraiczy, Ágnes Cseh, David Manlove: On weakly and strongly popular rankings. In: Discrete Applied Mathematics, 340 (2023). - S. 134-152.
doi:10.1016/j.dam.2023.06.041

2022

Artikel

Ágnes Cseh, Guillaume Escamocher, Begüm Genç, Luis Quesada: A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences. In: Constraints, 27 (2022). - S. 249-283.
doi:10.1007/s10601-022-09335-y

Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers: Understanding popular matchings via stable matchings. In: SIAM Journal on Discrete Mathematics, 36 (2022). - S. 188-213.
doi:10.1137/19M124770X

Buchkapitel

Ágnes Cseh, Guillaume Escamocher, Luis Quesada: Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. In: Christine Solnon (Hrsg.): 28th International Conference on Principles and Practice of Constraint Programming : CP 2022. - Wadern : Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2022.

Pascal Führlich, Ágnes Cseh, Pascal Lenzner: Improving ranking quality and fairness in Swiss-system chess tournaments. In: David M. Pennock (Hrsg.): Proceedings of the 23rd ACM Conference on Economics and Computation : EC '22. - New York : Association for Computing Machinery, 2022. - S. 1101-1102.
doi:10.1145/3490486.3538298

Ágnes Cseh, Tobias Friedrich, Jannik Peters: Pareto optimal and popular house allocation with lower and upper quotas. In: Catherine Pelachaud (Hrsg.): Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems : AAMAS 2022. - Richland, USA : International Foundation for Autonomous Agents and Multiagent Systems, 2022. - S. 300-308.

Ágnes Cseh, Jannik Peters: Three-dimensional popular matching with cyclic preferences. In: Catherine Pelachaud (Hrsg.): Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems : AAMAS 2022. - Richland, USA : International Foundation for Autonomous Agents and Multiagent Systems, 2022. - S. 309-317.

2021

Artikel

Tommy Andersson, Ágnes Cseh, Lars Ehlers, Albin Erlanson: Organizing time exchanges : Lessons from matching markets. In: American Economic Journal : Microeconomics, 13 (2021). - S. 338-373.
doi:10.1257/mic.20180236

Ágnes Cseh, Attila Juhos: Pairwise preferences in the stable marriage problem. In: ACM Transactions on Economics and Computation, 9 (2021). - .
doi:10.1145/3434427

Ágnes Cseh, Telikepalli Kavitha: Popular matchings in complete graphs. In: Algorithmica, 83 (2021). - S. 1493-1523.
doi:10.1007/s00453-020-00791-7

Buchkapitel

Sonja Kraiczy, Ágnes Cseh, David Manlove: On absolutely and simply popular rankings. In: Frank Dignum (Hrsg.): Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems : AAMAS 2021. - Richland, SC, USA : International Foundation for Autonomous Agents and Multiagent Systems, 2021. - S. 1563-1565.

Haris Aziz, Hau Chan, Ágnes Cseh, Bo Li, Fahimeh Ramezani, Chenhao Wang: Multi-Robot Task Allocation : Complexity and Approximation. In: Frank Dignum (Hrsg.): Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems : AAMAS 2021. - Richland, SC, USA : International Foundation for Autonomous Agents and Multiagent Systems, 2021. - S. 133-141.

2020

Artikel

Ágnes Cseh, Tamás Fleiner: The complexity of cake cutting with unequal shares. In: ACM Transactions on Algorithms, 16 (2020). - .
doi:10.1145/3380742

Ágnes Cseh, Klaus Heeger: The stable marriage problem with ties and restricted edges. In: Discrete Optimization, 36 (2020). - .

2019

Artikel

Ágnes Cseh, Jannik Matuschke: New and simple algorithms for stable flow problems. In: Algorithmica, 81 (2019). - S. 2557-2591.
doi:10.1007/s00453-018-00544-7

Ágnes Cseh, Tamás Fleiner, Petra Harján: Pareto optimal coalitions of fixed size. In: Journal of Mechanism and Institution Design, 4 (2019). - S. 87-108.
doi:10.22574/jmid.2019.11.003

Ágnes Cseh, Martin Skutella: Paths to stable allocations. In: International Journal of Game Theory, 48 (2019). - S. 835-862.
doi:10.1007/s00182-019-00664-6

Katarína Cechlárová, Ágnes Cseh, David F. Manlove: Selected open problems in matching under preferences. In: Bulletin of the European Association for Theoretical Computer Science EATCS, (2019). - .

Ágnes Cseh, Robert W. Irving, David F. Manlove: The stable roommates problem with short lists. In: Theory of Computing Systems, 63 (2019). - S. 128-149.
doi:10.1007/s00224-017-9810-9

Preprints

Haris Aziz, Ágnes Cseh: Optimal kidney exchange with immunosuppressants. - Budapest, 2019. -

2018

Artikel

Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke: Matchings with lower quotas : Algorithms and complexity. In: Algorithmica, 80 (2018). - S. 185-208.
doi:10.1007/s00453-016-0252-6

Ágnes Cseh, Telikepalli Kavitha: Popular edges and dominant matchings. In: Mathematical Programming, 172 (2018). - S. 209-229.
doi:10.1007/s10107-017-1183-y

2017

Artikel

Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha: Popular matchings with two-sided preferences and one-sided ties. In: SIAM Journal on Discrete Mathematics, 31 (2017). - S. 2348-2377.
doi:10.1137/16M1076162

Buchkapitel

Ágnes Cseh: Popular matchings. In: Ulle Endriss (Hrsg.): Trends in Computational Social Choice. - Europa : AI Access, 2017. - S. 105-122.

2016

Artikel

Ágnes Cseh, Brian C. Dean: Improved algorithmic results for unsplittable stable allocation problems. In: Journal of Combinatorial Optimization, 32 (2016). - S. 657-671.
doi:10.1007/s10878-015-9889-3

Ágnes Cseh, David F. Manlove: Stable marriage and roommates problems with restricted edges : complexity and approximability. In: Discrete Optimization, 20 (2016). - S. 62-89.
doi:10.1016/j.disopt.2016.03.002

Dissertation

Ágnes Cseh:Complexity and algorithms in matching problems under preferences. - Berlin: 2016.
(Dissertation, 2016, Technische Universität Berlin)
doi:10.14279/depositonce-5076

2013

Artikel

Ágnes Cseh, Jannik Matuschke, Martin Skutella: Stable flows over time. In: Algorithms, 6 (2013). - S. 532-545.
doi:10.3390/a6030532

Fakultät für Mathematik, Physik und Informatik
Mathematisches Institut

Dr. Ágnes Cseh
Akademische Rätin

Lehrstuhl für Wirtschaftsmathematik
Universität Bayreuth
95440 Bayreuth

Telefon: +49 921 55 7354
E-Mail: agnes.cseh@uni-bayreuth.de