Zobrazeno 1 - 10
of 128
pro vyhledávání: '"Cseh, Ágnes"'
We study deviations by a group of agents in the three main types of matching markets: the house allocation, the marriage, and the roommates models. For a given instance, we call a matching $k$-stable if no other matching exists that is more beneficia
Externí odkaz:
http://arxiv.org/abs/2307.03794
In each round of a Swiss-system tournament, players of similar score are paired against each other. An intentional early loss therefore might lead to weaker opponents in later rounds and thus to a better final tournament result - a phenomenon known a
Externí odkaz:
http://arxiv.org/abs/2302.10595
We study the problem of partitioning a set of agents into coalitions based on the agents' additively separable preferences, which can also be viewed as a hedonic game. We apply three successively weaker solution concepts, namely envy-freeness, weakly
Externí odkaz:
http://arxiv.org/abs/2209.07440
Autor:
Schlotter, Ildikó, Cseh, Ágnes
In a graph where vertices have preferences over their neighbors, a matching is called popular if it does not lose a head-to-head election against any other matching when the vertices vote between the matchings. Popular matchings can be seen as an int
Externí odkaz:
http://arxiv.org/abs/2205.02189
The International Chess Federation (FIDE) imposes a voluminous and complex set of player pairing criteria in Swiss-system chess tournaments and endorses computer programs that are able to calculate the prescribed pairings. The purpose of these formal
Externí odkaz:
http://arxiv.org/abs/2112.10522
Autor:
Heeger, Klaus, Cseh, Ágnes
In the Popular Matching problem, we are given a bipartite graph $G = (A \cup B, E)$ and for each vertex $v\in A\cup B$, strict preferences over the neighbors of $v$. Given two matchings $M$ and $M'$, matching $M$ is more popular than $M'$ if the numb
Externí odkaz:
http://arxiv.org/abs/2110.05901
The input of the popular roommates problem consists of a graph $G = (V, E)$ and for each vertex $v\in V$, strict preferences over the neighbors of $v$. Matching $M$ is more popular than $M'$ if the number of vertices preferring $M$ to $M'$ is larger
Externí odkaz:
http://arxiv.org/abs/2107.06694
In the house allocation problem with lower and upper quotas, we are given a set of applicants and a set of projects. Each applicant has a strictly ordered preference list over the projects, while the projects are equipped with a lower and an upper qu
Externí odkaz:
http://arxiv.org/abs/2107.03801
Autor:
Cseh, Ágnes, Peters, Jannik
Two actively researched problem settings in matchings under preferences are popular matchings and the three-dimensional stable matching problem with cyclic preferences. In this paper, we apply the optimality notion of the first topic to the input cha
Externí odkaz:
http://arxiv.org/abs/2105.09115
Multi-robot task allocation is one of the most fundamental classes of problems in robotics and is crucial for various real-world robotic applications such as search, rescue and area exploration. We consider the Single-Task robots and Multi-Robot task
Externí odkaz:
http://arxiv.org/abs/2103.12370