Ágnes Cseh

According to our database, Ágnes Cseh authored at least 39 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Envy-freeness in 3D hedonic games.

Michael McKay, Ágnes Cseh, David F. Manlove

Auton. Agents Multi Agent Syst., December, 2024

Popular matchings with weighted voters.

Klaus Heeger, Ágnes Cseh

Games Econ. Behav., 2024

2023

On weakly and strongly popular rankings.

Sonja Kraiczy, Ágnes Cseh, David F. Manlove

Discret. Appl. Math., December, 2023

A quest for a fair schedule: The International Young Physicists' Tournament.

Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kires, Lukás Mino

J. Sched., February, 2023

Computing relaxations for the three-dimensional stable matching problem with cyclic preferences.

Ágnes Cseh, Guillaume Escamocher, Luis Quesada

Constraints An Int. J., 2023

Computational Complexity of k-Stable Matchings.

Haris Aziz, Gergely Csáji, Ágnes Cseh

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

The Swiss Gambit.

Ágnes Cseh, Pascal Führlich, Pascal Lenzner

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Understanding Popular Matchings via Stable Matchings.

Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers

SIAM J. Discret. Math., 2022

Maximum-utility popular matchings with bounded instability.

Ildikó Schlotter, Ágnes Cseh

CoRR, 2022

A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences.

Ágnes Cseh, Guillaume Escamocher, Begüm Genç, Luis Quesada

Constraints An Int. J., 2022

Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments.

Pascal Führlich, Ágnes Cseh, Pascal Lenzner

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Three-Dimensional Popular Matching with Cyclic Preferences.

Ágnes Cseh, Jannik Peters

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Pareto Optimal and Popular House Allocation with Lower and Upper Quotas.

Ágnes Cseh, Tobias Friedrich, Jannik Peters

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Pairwise Preferences in the Stable Marriage Problem.

Ágnes Cseh, Attila Juhos

ACM Trans. Economics and Comput., 2021

Polynomially tractable cases in the popular roommates problem.

Erika R. Bérczi-Kovács, Ágnes Cseh, Kata Kosztolányi, Attila Mályusz

CoRR, 2021

On absolutely and simply popular rankings.

Sonja Kraiczy, Ágnes Cseh, David F. Manlove

CoRR, 2021

Popular Matchings in Complete Graphs.

Ágnes Cseh, Telikepalli Kavitha

Algorithmica, 2021

Multi-Robot Task Allocation-Complexity and Approximation.

Haris Aziz, Hau Chan, Ágnes Cseh, Bo Li, Fahimeh Ramezani, Chenhao Wang

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Optimal Kidney Exchange with Immunosuppressants.

Haris Aziz, Ágnes Cseh, John P. Dickerson, Duncan C. McElfresh

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

The Complexity of Cake Cutting with Unequal Shares.

Ágnes Cseh, Tamás Fleiner

ACM Trans. Algorithms, 2020

The stable marriage problem with ties and restricted edges.

Ágnes Cseh, Klaus Heeger

Discret. Optim., 2020

A quest for a fair schedule: The Young Physicists' Tournament.

Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kires, Lukás Mino

CoRR, 2020

2019

The Stable Roommates Problem with Short Lists.

Ágnes Cseh, Robert W. Irving, David F. Manlove

Theory Comput. Syst., 2019

Paths to stable allocations.

Ágnes Cseh, Martin Skutella

Int. J. Game Theory, 2019

Selected open problems in Matching Under Preferences.

Katarína Cechlárová, Ágnes Cseh, David F. Manlove

Bull. EATCS, 2019

Pareto optimal coalitions of fixed size.

Ágnes Cseh, Tamás Fleiner, Petra Harján

CoRR, 2019

New and Simple Algorithms for Stable Flow Problems.

Ágnes Cseh, Jannik Matuschke

Algorithmica, 2019

2018

Popular edges and dominant matchings.

Ágnes Cseh, Telikepalli Kavitha

Math. Program., 2018

Popularity, stability, and the dominant matching polytope.

Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers

CoRR, 2018

Matchings with Lower Quotas: Algorithms and Complexity.

Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke

Algorithmica, 2018

2017

Popular Matchings with Two-Sided Preferences and One-Sided Ties.

Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha

SIAM J. Discret. Math., 2017

2016

Improved algorithmic results for unsplittable stable allocation problems.

Ágnes Cseh, Brian C. Dean

J. Comb. Optim., 2016

Marriages are made in calculation.

Ágnes Cseh

Bull. EATCS, 2016

Stable Marriage and Roommates problems with restricted edges: Complexity and approximability.

Ágnes Cseh, David F. Manlove

Discret. Optim., 2016

2015

Many-to-one Matchings with Lower Quotas: Algorithms and Complexity.

Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

The Student/Project Allocation problem with group projects.

Ashwin Arulselvan, Ágnes Cseh, Jannik Matuschke

CoRR, 2014

2013

Stable flows with restricted edges.

Ágnes Cseh

CoRR, 2013

Stable Flows over Time.

Ágnes Cseh, Jannik Matuschke, Martin Skutella

Algorithms, 2013

2012

Paths to stable allocations

Ágnes Cseh

CoRR, 2012