Ágnes Cseh

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 62

Top Topics

Preference Elicitation

Additively Separable

Computational Complexity

Top Venues

Publications

Michael McKay, Ágnes Cseh, David F. Manlove
Envy-freeness in 3D hedonic games. Auton. Agents Multi Agent Syst. 38 (2) (2024)
Klaus Heeger, Ágnes Cseh
Popular matchings with weighted voters. Games Econ. Behav. 144 (2024)
Haris Aziz, Gergely Csáji, Ágnes Cseh
Computational Complexity of k-Stable Matchings. SAGT (2023)
Ágnes Cseh, Guillaume Escamocher, Luis Quesada
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. Constraints An Int. J. 28 (2) (2023)
Sonja Kraiczy, Ágnes Cseh, David F. Manlove
On weakly and strongly popular rankings. Discret. Appl. Math. 340 (2023)
Ágnes Cseh, Pascal Führlich, Pascal Lenzner
The Swiss Gambit. AAMAS (2023)
Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kires, Lukás Mino
A quest for a fair schedule: The International Young Physicists' Tournament. J. Sched. 26 (1) (2023)
Ágnes Cseh, Pascal Führlich, Pascal Lenzner
The Swiss Gambit. CoRR (2023)
Haris Aziz, Gergely Csáji, Ágnes Cseh
Computational complexity of k-stable matchings. CoRR (2023)
Ágnes Cseh, Jannik Peters
Three-Dimensional Popular Matching with Cyclic Preferences. AAMAS (2022)
Ildikó Schlotter, Ágnes Cseh
Maximum-utility popular matchings with bounded instability. CoRR (2022)
Ágnes Cseh, Tobias Friedrich, Jannik Peters
Pareto Optimal and Popular House Allocation with Lower and Upper Quotas. AAMAS (2022)
Ágnes Cseh, Guillaume Escamocher, Luis Quesada
Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. CP (2022)
Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers
Understanding Popular Matchings via Stable Matchings. SIAM J. Discret. Math. 36 (1) (2022)
Ágnes Cseh, Michael McKay, David F. Manlove
Envy-freeness in 3D Hedonic Games. CoRR (2022)
Pascal Führlich, Ágnes Cseh, Pascal Lenzner
Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments. EC (2022)
Á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. Constraints An Int. J. 27 (3) (2022)
Á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. CP (2021)
Klaus Heeger, Ágnes Cseh
Popular matchings with weighted voters. CoRR (2021)
Erika R. Bérczi-Kovács, Ágnes Cseh, Kata Kosztolányi, Attila Mályusz
Polynomially tractable cases in the popular roommates problem. CoRR (2021)
Haris Aziz, Ágnes Cseh, John P. Dickerson, Duncan C. McElfresh
Optimal Kidney Exchange with Immunosuppressants. CoRR (2021)
Haris Aziz, Hau Chan, Ágnes Cseh, Bo Li, Fahimeh Ramezani, Chenhao Wang
Multi-Robot Task Allocation-Complexity and Approximation. AAMAS (2021)
Ágnes Cseh, Tobias Friedrich, Jannik Peters
Pareto optimal and popular house allocation with lower and upper quotas. CoRR (2021)
Haris Aziz, Hau Chan, Ágnes Cseh, Bo Li, Fahimeh Ramezani, Chenhao Wang
Multi-Robot Task Allocation - Complexity and Approximation. CoRR (2021)
Pascal Führlich, Ágnes Cseh, Pascal Lenzner
Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments. CoRR (2021)
Sonja Kraiczy, Ágnes Cseh, David F. Manlove
On Weakly and Strongly Popular Rankings. AAMAS (2021)
Sonja Kraiczy, Ágnes Cseh, David F. Manlove
On absolutely and simply popular rankings. CoRR (2021)
Ágnes Cseh, Jannik Peters
Three-Dimensional Popular Matching with Cyclic Preferences. CoRR (2021)
Ágnes Cseh, Attila Juhos
Pairwise Preferences in the Stable Marriage Problem. ACM Trans. Economics and Comput. 9 (1) (2021)
Ágnes Cseh, Telikepalli Kavitha
Popular Matchings in Complete Graphs. Algorithmica 83 (5) (2021)
Haris Aziz, Ágnes Cseh, John P. Dickerson, Duncan C. McElfresh
Optimal Kidney Exchange with Immunosuppressants. AAAI (2021)
Ágnes Cseh, Klaus Heeger
The stable marriage problem with ties and restricted edges. Discret. Optim. 36 (2020)
Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kires, Lukás Mino
A quest for a fair schedule: The Young Physicists' Tournament. CoRR (2020)
Ágnes Cseh, Tamás Fleiner
The Complexity of Cake Cutting with Unequal Shares. ACM Trans. Algorithms 16 (3) (2020)
Ágnes Cseh, Attila Juhos
Pairwise Preferences in the Stable Marriage Problem. STACS (2019)
Ágnes Cseh, Jannik Matuschke
New and Simple Algorithms for Stable Flow Problems. Algorithmica 81 (6) (2019)
Ágnes Cseh, Robert W. Irving, David F. Manlove
The Stable Roommates Problem with Short Lists. Theory Comput. Syst. 63 (1) (2019)
Katarína Cechlárová, Ágnes Cseh, David F. Manlove
Selected open problems in Matching Under Preferences. Bull. EATCS 128 (2019)
Ágnes Cseh, Klaus Heeger
The stable marriage problem with ties and restricted edges. CoRR (2019)
Ágnes Cseh, Martin Skutella
Paths to stable allocations. Int. J. Game Theory 48 (3) (2019)
Ágnes Cseh, Tamás Fleiner, Petra Harján
Pareto optimal coalitions of fixed size. CoRR (2019)
Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers
Popularity, stability, and the dominant matching polytope. CoRR (2018)
Ágnes Cseh, Telikepalli Kavitha
Popular Matchings in Complete Graphs. FSTTCS (2018)
Ágnes Cseh, Telikepalli Kavitha
Popular edges and dominant matchings. Math. Program. 172 (1-2) (2018)
Ágnes Cseh, Tamás Fleiner
The Complexity of Cake Cutting with Unequal Shares. SAGT (2018)
Ágnes Cseh, Attila Juhos
Pairwise preferences in the stable marriage problem. CoRR (2018)
Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke
Matchings with Lower Quotas: Algorithms and Complexity. Algorithmica 80 (1) (2018)
Ágnes Cseh, Telikepalli Kavitha
Popular Matchings in Complete Graphs. CoRR (2018)
Ágnes Cseh, Jannik Matuschke
New and Simple Algorithms for Stable Flow Problems. WG (2017)
Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha
Popular Matchings with Two-Sided Preferences and One-Sided Ties. SIAM J. Discret. Math. 31 (4) (2017)
Ágnes Cseh, Tamás Fleiner
The complexity of cake cutting with unequal shares. CoRR (2017)
Ágnes Cseh
Marriages are made in calculation. Bull. EATCS 120 (2016)
Ágnes Cseh, Telikepalli Kavitha
Popular Edges and Dominant Matchings. IPCO (2016)
Ágnes Cseh, Brian C. Dean
Improved algorithmic results for unsplittable stable allocation problems. J. Comb. Optim. 32 (3) (2016)
Ágnes Cseh, David F. Manlove
Stable Marriage and Roommates problems with restricted edges: Complexity and approximability. Discret. Optim. 20 (2016)
Ágnes Cseh, Robert W. Irving, David F. Manlove
The Stable Roommates Problem with Short Lists. SAGT (2016)
Ágnes Cseh, Robert W. Irving, David F. Manlove
The Stable Roommates problem with short lists. CoRR (2016)
Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha
Popular matchings with two-sided preferences and one-sided ties. CoRR (2016)
Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke
Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. ISAAC (2015)
Ágnes Cseh, David F. Manlove
Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability. SAGT (2015)
Ágnes Cseh, Telikepalli Kavitha
Popular Edges and Dominant Matchings. CoRR (2015)
Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha
Popular Matchings with Two-Sided Preferences and One-Sided Ties. ICALP (1) (2015)
Ágnes Cseh, David F. Manlove
Stable marriage and roommates problems with restricted edges: complexity and approximability. CoRR (2014)
Ágnes Cseh, Martin Skutella
Paths to Stable Allocations. SAGT (2014)
Ashwin Arulselvan, Ágnes Cseh, Jannik Matuschke
The Student/Project Allocation problem with group projects. CoRR (2014)
Ágnes Cseh, Brian C. Dean
Improved Algorithmic Results for Unsplittable Stable Allocation Problems. CoRR (2014)
Ágnes Cseh
Stable flows with restricted edges. CoRR (2013)
Ágnes Cseh, Jannik Matuschke, Martin Skutella
Stable Flows over Time. Algorithms 6 (3) (2013)
Ágnes Cseh
Paths to stable allocations CoRR (2012)