Gergely Csáji | DeepAI

DeepAI AI Chat

Featured Co-authors

Haris Aziz
61 publications
Kristóf Bérczi
31 publications
Jiehua Chen
27 publications
Ágnes Cseh
20 publications
Yu Yokoi
17 publications
Tamás Király
13 publications
Péter Biró
11 publications

∙ 07/07/2023

Computational complexity of k-stable matchings

We study deviations by a group of agents in the three main types of matc...

0 Haris Aziz, et al. ∙

∙ 04/05/2023

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems

We give a simple approximation algorithm for a common generalization of ...

0 Gergely Csáji, et al. ∙

∙ 02/03/2023

Optimal Capacity Modification for Many-To-One Matching Problems

We consider many-to-one matching problems, where one side consists of st...

0 Jiehua Chen, et al. ∙

∙ 09/06/2022

Solving the Maximum Popular Matching Problem with Matroid Constraints

We consider the problem of finding a maximum popular matching in a many-...

0 Gergely Csáji, et al. ∙

∙ 08/20/2022

Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching

The Stable Marriage problem (SM), solved by the famous deferred acceptan...

0 Gergely Csáji, et al. ∙

∙ 06/23/2022

On the complexity of packing rainbow spanning trees

One of the most important questions in matroid optimization is to find d...

0 Kristóf Bérczi, et al. ∙

∙ 04/28/2022

Manipulating the outcome of stable matching and roommates problems

The stable marriage and stable roommates problems have been extensively ...

0 Kristóf Bérczi, et al. ∙

∙ 02/11/2022

Strong core and Pareto-optimal solutions for the multiple partners matching problem under lexicographic preferences

In a multiple partners matching problem the agents can have multiple par...

0 Péter Biró, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world