Veröffentlichungen "Cseh, Ágnes"

Artikel in einer Zeitschrift

Sauer, Pascal ; Cseh, Ágnes ; Lenzner, Pascal:
Improving ranking quality and fairness in Swiss-system chess tournaments.
In: Journal of Quantitative Analysis in Sports. (2024) .
ISSN 1559-0410
DOI: https://doi.org/10.1515/jqas-2022-0090

Heeger, Klaus ; Cseh, Ágnes:
Popular matchings with weighted voters.
In: Games and Economic Behavior. Bd. 144 (2024) . - S. 300-328.
ISSN 0899-8256
DOI: https://doi.org/10.1016/j.geb.2024.01.015

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

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

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

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

Cseh, Ágnes ; Faenza, Yuri ; Kavitha, Telikepalli ; Powers, Vladlena:
Understanding popular matchings via stable matchings.
In: SIAM Journal on Discrete Mathematics. Bd. 36 (2022) Heft 1 . - S. 188-213.
ISSN 1095-7146
DOI: https://doi.org/10.1137/19M124770X

Andersson, Tommy ; Cseh, Ágnes ; Ehlers, Lars ; Erlanson, Albin:
Organizing time exchanges : Lessons from matching markets.
In: American Economic Journal : Microeconomics. Bd. 13 (2021) Heft 1 . - S. 338-373.
ISSN 1945-7685
DOI: https://doi.org/10.1257/mic.20180236

Cseh, Ágnes ; Juhos, Attila:
Pairwise preferences in the stable marriage problem.
In: ACM Transactions on Economics and Computation. Bd. 9 (2021) Heft 1 . - 7.
ISSN 2167-8383
DOI: https://doi.org/10.1145/3434427

Cseh, Ágnes ; Kavitha, Telikepalli:
Popular matchings in complete graphs.
In: Algorithmica. Bd. 83 (2021) Heft 5 . - S. 1493-1523.
ISSN 1432-0541
DOI: https://doi.org/10.1007/s00453-020-00791-7

Cseh, Ágnes ; Fleiner, Tamás:
The complexity of cake cutting with unequal shares.
In: ACM Transactions on Algorithms. Bd. 16 (2020) Heft 3 . - 29.
ISSN 1549-6333
DOI: https://doi.org/10.1145/3380742

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

Cseh, Ágnes ; Matuschke, Jannik:
New and simple algorithms for stable flow problems.
In: Algorithmica. Bd. 81 (2019) Heft 6 . - S. 2557-2591.
ISSN 1432-0541
DOI: https://doi.org/10.1007/s00453-018-00544-7

Cseh, Ágnes ; Fleiner, Tamás ; Harján, Petra:
Pareto optimal coalitions of fixed size.
In: Journal of Mechanism and Institution Design. Bd. 4 (2019) Heft 1 . - S. 87-108.
ISSN 2399-8458
DOI: https://doi.org/10.22574/jmid.2019.11.003

Cseh, Ágnes ; Skutella, Martin:
Paths to stable allocations.
In: International Journal of Game Theory. Bd. 48 (2019) Heft 3 . - S. 835-862.
ISSN 1432-1270
DOI: https://doi.org/10.1007/s00182-019-00664-6

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

Cseh, Ágnes ; Irving, Robert W. ; Manlove, David F.:
The stable roommates problem with short lists.
In: Theory of Computing Systems. Bd. 63 (2019) Heft 1 . - S. 128-149.
ISSN 1433-0490
DOI: https://doi.org/10.1007/s00224-017-9810-9

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

Cseh, Ágnes ; Kavitha, Telikepalli:
Popular edges and dominant matchings.
In: Mathematical Programming. Bd. 172 (2018) Heft 1 . - S. 209-229.
ISSN 1436-4646
DOI: https://doi.org/10.1007/s10107-017-1183-y

Cseh, Ágnes ; Huang, Chien-Chung ; Kavitha, Telikepalli:
Popular matchings with two-sided preferences and one-sided ties.
In: SIAM Journal on Discrete Mathematics. Bd. 31 (2017) Heft 4 . - S. 2348-2377.
ISSN 1095-7146
DOI: https://doi.org/10.1137/16M1076162

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

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

Cseh, Ágnes ; Matuschke, Jannik ; Skutella, Martin:
Stable flows over time.
In: Algorithms. Bd. 6 (2013) Heft 3 . - S. 532-545.
ISSN 1999-4893
DOI: https://doi.org/10.3390/a6030532

Aufsatz in einem Buch

Cseh, Ágnes ; Escamocher, Guillaume ; Quesada, Luis:
Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences.
In: Solnon, Christine (Hrsg.): 28th International Conference on Principles and Practice of Constraint Programming : CP 2022. - Wadern : Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing , 2022 . - No. 16 . - (Leibniz International Proceedings in Informatics (LIPIcs) ; 235 )
ISBN 978-3-95977-240-2

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

Cseh, Ágnes ; Friedrich, Tobias ; Peters, Jannik:
Pareto optimal and popular house allocation with lower and upper quotas.
In: Pelachaud, Catherine (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
ISBN 978-1-4503-9213-6

Cseh, Ágnes ; Peters, Jannik:
Three-dimensional popular matching with cyclic preferences.
In: Pelachaud, Catherine (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
ISBN 978-1-4503-9213-6

Aziz, Haris ; Chan, Hau ; Cseh, Ágnes ; Li, Bo ; Ramezani, Fahimeh ; Wang, Chenhao:
Multi-Robot Task Allocation : Complexity and Approximation.
In: Dignum, Frank (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
ISBN 978-1-4503-8307-3

Kraiczy, Sonja ; Cseh, Ágnes ; Manlove, David:
On absolutely and simply popular rankings.
In: Dignum, Frank (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
ISBN 978-1-4503-8307-3

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

Working paper, Diskussionspapier

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

Dissertation

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