Ágnes Cseh

Orcid: 0000-0003-4991-2599

Affiliations:
  • University of Bayreuth, Faculty of Mathematics, Physics, and Computer Sciences, Germany
  • Hasso Plattner Institute, Potsdam, Germany (former)
  • Hungarian Academy of Sciences, Institute of Economics, Hungary (former)
  • TU Berlin, Institute of Mathematics, Germany (PhD 2015)


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Envy-freeness in 3D hedonic games.
Auton. Agents Multi Agent Syst., December, 2024

Popular matchings with weighted voters.
Games Econ. Behav., 2024

2023
On weakly and strongly popular rankings.
Discret. Appl. Math., December, 2023

A quest for a fair schedule: The International Young Physicists' Tournament.
J. Sched., February, 2023

Computing relaxations for the three-dimensional stable matching problem with cyclic preferences.
Constraints An Int. J., 2023

Computational Complexity of k-Stable Matchings.
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

The Swiss Gambit.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Understanding Popular Matchings via Stable Matchings.
SIAM J. Discret. Math., 2022

Maximum-utility popular matchings with bounded instability.
CoRR, 2022

A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences.
Constraints An Int. J., 2022

Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments.
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.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Pareto Optimal and Popular House Allocation with Lower and Upper Quotas.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
Pairwise Preferences in the Stable Marriage Problem.
ACM Trans. Economics and Comput., 2021

Polynomially tractable cases in the popular roommates problem.
CoRR, 2021

On absolutely and simply popular rankings.
CoRR, 2021

Popular Matchings in Complete Graphs.
Algorithmica, 2021

Multi-Robot Task Allocation-Complexity and Approximation.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Optimal Kidney Exchange with Immunosuppressants.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
The Complexity of Cake Cutting with Unequal Shares.
ACM Trans. Algorithms, 2020

The stable marriage problem with ties and restricted edges.
Discret. Optim., 2020

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

2019
The Stable Roommates Problem with Short Lists.
Theory Comput. Syst., 2019

Paths to stable allocations.
Int. J. Game Theory, 2019

Selected open problems in Matching Under Preferences.
Bull. EATCS, 2019

Pareto optimal coalitions of fixed size.
CoRR, 2019

New and Simple Algorithms for Stable Flow Problems.
Algorithmica, 2019

2018
Popular edges and dominant matchings.
Math. Program., 2018

Popularity, stability, and the dominant matching polytope.
CoRR, 2018

Matchings with Lower Quotas: Algorithms and Complexity.
Algorithmica, 2018

2017
Popular Matchings with Two-Sided Preferences and One-Sided Ties.
SIAM J. Discret. Math., 2017

2016
Improved algorithmic results for unsplittable stable allocation problems.
J. Comb. Optim., 2016

Marriages are made in calculation.
Bull. EATCS, 2016

Stable Marriage and Roommates problems with restricted edges: Complexity and approximability.
Discret. Optim., 2016

2015
Many-to-one Matchings with Lower Quotas: Algorithms and Complexity.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
The Student/Project Allocation problem with group projects.
CoRR, 2014

2013
Stable flows with restricted edges.
CoRR, 2013

Stable Flows over Time.
Algorithms, 2013

2012
Paths to stable allocations
CoRR, 2012


  Loading...