Ágnes Cseh

Research Interest

• Computational social choice
• Combinatorial optimization
• Graph theory
• Matching under preferences

Short CV

Previous work experience

• postdoctoral researcher at Hungarian Academy of Sciences, Institute of Economics, Sep 2016 -
• part-time lecturer at the Department of Operations Research and Actuarial Sciences, Corvinus University of Budapest, Feb 2017 - Jan 2018
• part-time lecturer at the Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Sep 2016 - Jan 2017
• postdoctoral researcher at ICE-TCS, Reykjavík University, Jan-Aug 2016

Education

• PhD in Mathematics under the supervision of Martin Skutella at TU Berlin, 2015
• MSc in Mathematics at TU Berlin, 2012
• BSc in Mathematics at Budapest University of Technology and Economics, 2010

PhD thesis: Complexity and algorithms in matching problems under preferences

Publications

2023

•  

  Cseh, Ágnes; Führlich, Pascal; Lenzner, PascalThe Swiss GambitAutonomous Agents and Multi-Agent Systems (AAMAS) 2023

  [ ][ ][ URL ][ Download ]

2022

•  

  Cseh, Ágnes; Peters, JannikThree-Dimensional Popular Matching with Cyclic PreferencesAutonomous Agents and Multi-Agent Systems (AAMAS) 2022: 77–87

  [ ][ ][ URL ][ Download ]

•  

  Cseh, Ágnes; Friedrich, Tobias; Peters, JannikPareto Optimal and Popular House Allocation with Lower and Upper QuotasAutonomous Agents and Multi-Agent Systems (AAMAS) 2022: 300–308

  [ ][ ][ URL ][ Download ]

•  

  Führlich, Pascal; Cseh, Ágnes; Lenzner, PascalImproving Ranking Quality and Fairness in Swiss-System Chess TournamentsACM Conference on Economics and Computation (EC) 2022: 1101–1102

  [ ][ ][ URL ][ DOI ][ Download ]

2021

•  

  Cseh, Ágnes; Juhos, AttilaPairwise Preferences in the Stable Marriage ProblemACM Transactions on Economics and Computation (TEAC) 2021: 1–28

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Cseh, Ágnes; Kavitha, TelikepalliPopular matchings in complete graphsAlgorithmica 2021: 1–31

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Andersson, Tommy; Cseh, Ágnes; Ehlers, Lars; Erlanson, AlbinOrganizing time exchanges: Lessons from matching marketsAmerican Economic Journal: Microeconomics 2021: 338–73

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Aziz, Haris; Cseh, Agnes; Dickerson, John; McElfresh, DuncanOptimal Kidney Exchange with ImmunosuppressantsConference on Artificial Intelligence (AAAI) 2021: 21–29

  [ ][ ][ URL ][ Download ]

•  

  Aziz, Haris; Chan, Hau; Cseh, Ágnes; Li, Bo; Ramezani, Fahimeh; Wang, ChenhaoMulti-Robot Task Allocation—Complexity and ApproximationAutonomous Agents and Multiagent Systems (AAMAS) 2021: 133–141

  [ ][ ][ URL ][ Download ]

•  

  Kraiczy, Sonja; Cseh, Ágnes; Manlove, DavidOn Weakly and Strongly Popular RankingsAutonomous Agents and Multiagent Systems (AAMAS) 2021: 1563–1565

  [ ][ ][ URL ][ Download ]

2020

•  

  Cseh, Ágnes; Fleiner, TamásThe Complexity of Cake Cutting with Unequal SharesACM Transactions on Algorithms 2020: 1–21

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Cseh, Ágnes; Heeger, KlausThe stable marriage problem with ties and restricted edgesDiscrete Optimization 2020: 100571

  [ ][ ][ URL ][ DOI ][ Download ]

2019

•  

  Cseh, Ágnes; Matuschke, JannikNew and Simple Algorithms for Stable Flow ProblemsAlgorithmica 2019: 2557–2591

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Cechlárová, Katarína; Cseh, Ágnes; Manlove, DavidSelected open problems in Matching Under PreferencesBulletin of the European Association for Theoretical Computer Science 2019: 14–38

  [ ][ ][ URL ][ Download ]

•  

  Cseh, Ágnes; Skutella, MartinPaths to stable allocationsInternational Journal of Game Theory 2019: 835–862

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Cseh, Ágnes; Irving, Robert W.; Manlove, David F.The Stable Roommates Problem with Short ListsTheory of Computing Systems 2019: 128–149

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Cseh, Ágnes; Juhos, AttilaPairwise Preferences in the Stable Marriage ProblemSymposium Theoretical Aspects of Computer Science (STACS) 2019: 21:1–21:16

  [ ][ ][ URL ][ DOI ][ Download ]

2018

•  

  Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; Manlove, David F.; Matuschke, JannikMatchings with Lower Quotas: Algorithms and ComplexityAlgorithmica 2018: 185–208

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Cseh, Ágnes; Kavitha, TelikepalliPopular edges and dominant matchingsMathematical Programming 2018: 209–229

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Cseh, Ágnes; Kavitha, TelikepalliPopular Matchings in Complete GraphsFoundations of Software Technology and Theoretical Computer Science (FSTTCS) 2018: 17:1–17:14

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Cseh, Ágnes; Fleiner, TamásThe Complexity of Cake Cutting with Unequal SharesSymposium Algorithmic Game Theory (SAGT) 2018: 19–30

  [ ][ ][ URL ][ DOI ]

2017

•  

  Cseh, Ágnes; Huang, Chien-Chung; Kavitha, TelikepalliPopular Matchings with Two-Sided Preferences and One-Sided TiesSIAM Journal on Discrete Mathematics 2017: 367–379

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Cseh, Ágnes; Matuschke, JannikNew and Simple Algorithms for Stable Flow ProblemsWorkshop Graph-Theoretic Concepts in Computer Science (WG) 2017: 206–219

  [ ][ ][ URL ][ DOI ]

2016

•  

  Cseh, ÁgnesMarriages are made in calculationBulletin of the European Association for Theoretical Computer Science 2016: 180–183

  [ ][ ][ URL ][ Download ]

•  

  Cseh, Ágnes; Manlove, David F.Stable Marriage and Roommates problems with restricted edges: Complexity and approximabilityDiscrete Optimization 2016: 62–89

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Cseh, Ágnes; Dean, Brian C.Improved algorithmic results for unsplittable stable allocation problemsJournal of Combinatorial Optimization 2016: 657–671

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Cseh, Ágnes; Kavitha, TelikepalliPopular Edges and Dominant MatchingsInternational Conference on Integer Programming and Combinatorial Optimization (IPCO) 2016: 138–151

  [ ][ ][ URL ][ DOI ]

•  

  Cseh, Ágnes; Irving, Robert W.; Manlove, David F.The Stable Roommates Problem with Short ListsSymposium Algorithmic Game Theory (SAGT) 2016: 207–219

  [ ][ ][ URL ][ DOI ]

2015

•  

  Cseh, Ágnes; Huang, Chien-Chung; Kavitha, TelikepalliPopular Matchings with Two-Sided Preferences and One-Sided TiesInternational Colloquium on Automata, Languages and Programming (ICALP) 2015: 367–379

  [ ][ ][ URL ][ DOI ]

•  

  Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; Manlove, David F.; Matuschke, JannikMany-to-one Matchings with Lower Quotas: Algorithms and ComplexityInternational Symposium Algorithms and Computation (ISAAC) 2015: 176–187

  [ ][ ][ URL ][ DOI ]

•  

  Cseh, Ágnes; Manlove, David F.Stable Marriage and Roommates Problems with Restricted Edges: Complexity and ApproximabilitySymposium Algorithmic Game Theory (SAGT) 2015: 15–26

  [ ][ ][ URL ][ DOI ]

2014

•  

  Cseh, Ágnes; Skutella, MartinPaths to Stable AllocationsSymposium Algorithmic Game Theory (SAGT) 2014: 61–73

  [ ][ ][ URL ][ DOI ]

2013

•  

  Cseh, Ágnes; Matuschke, Jannik; Skutella, MartinStable Flows over TimeAlgorithms 2013: 532–545

  [ ][ ][ URL ][ DOI ][ Download ]