Head of the research group "Efficient algorithms for allocation problems" supported by the Hungarian Scientific Research Fund. Researcher at the Institute of Economics, Hungarian Academy of Sciences, in the group 'Mechanism Design' led by Péter Biró.
Research interests: graph algorithms, game theory, complexity, combinatorial optimization, stable matchings, popular matchings.
E-mail: cseh.agnes (at) krtk.mta.hu
News and upcoming events
- September 2019: I am an invited speaker at the "Markets, Algorithms, Prediction and Learning" workshop at Politecnico di Milano.
- July 2019: I am talking about "Popular Matchings in Complete Graphs" at the Research Colloquium of the group "Algorithmics and Computational Complexity" at TU Berlin.
- June 2019: I am talking about "Pareto optimal coalitions of fixed size" as an invited speaker at the "Designing and Evaluating Matching Markets" workshop at WZB Berlin.
- June 2019: My survey paper "Selected open problems in Matching Under Preferences" written with Katarina Cechlarova and David Manlove has appeared in the Bulleting of EATCS.