#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2013

2017

- This year (3)
- Last 5 years (15)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ágnes Cseh, Telikepalli Kavitha
- IPCO
- 2016

Given a bipartite graph G = (A∪B,E) with strict preference lists and e∗ ∈ E, we ask if there exists a popular matching in G that contains the edge e∗. We call this the popular edge problem. A matching M is popular if there is no matching M′ such that the vertices that prefer M′ to M outnumber those that prefer M to M′. It is known that every stable matching… (More)

- Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha
- ICALP
- 2015

We are given a bipartite graph G = (A ∪ B,E) where each vertex has a preference list ranking its neighbors: in particular, every a ∈ A ranks its neighbors in a strict order of preference, whereas the preference lists of b ∈ B may contain ties. A matching M is popular if there is no matching M ′ such that the number of vertices that prefer M ′ to M exceeds… (More)

- Ágnes Cseh, Jannik Matuschke
- WG
- 2017

Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another. An instance of the problem consists of a capacitated directed network, in which vertices express their preferences over their incident edges. A network flow is stable if there is no group of… (More)

- Ágnes Cseh, Jannik Matuschke, Martin Skutella
- Algorithms
- 2013

In this paper, the notion of stability is extended to network flows over time. As a useful device in our proofs, we present an elegant preflow-push variant of the Gale-Shapley algorithm that operates directly on the given network and computes stable flows in pseudo-polynomial time, both in the static flow and the flow over time case. We show periodical… (More)

- Ágnes Cseh, Robert W. Irving, David Manlove
- Theory of Computing Systems
- 2016

We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists (sri) that are degree constrained, i.e., preference lists are of bounded length. The first variant, egald-sri, involves finding an egalitarian stable matching in solvable instances of sri with preference lists of length at most d. We… (More)

- Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David Manlove, Jannik Matuschke
- Algorithmica
- 2016

We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph $$G= (A\, \dot{\cup }\, P, E)$$ G = ( A ∪ ˙ P , E ) with weights on the edges in E, and with lower and upper quotas on the vertices in P. We seek a maximum weight many-to-one matching satisfying two sets of constraints: vertices… (More)

- Ágnes Cseh, Tamás Fleiner
- ArXiv
- 2017

An unceasing problem of our prevailing society is the fair division of goods. The problem of fair cake cutting is dividing a heterogeneous and divisible resource, the cake, among n players who value pieces according to their own measure function. The goal is to assign each player a not necessarily connected part of the cake that the player evaluates at… (More)

- Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David Manlove, Jannik Matuschke
- ISAAC
- 2015

We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = (A∪̇P,E) with weights on the edges in E, and with lower and upper quotas on the vertices in P . We seek a maximum weight many-toone matching satisfying two sets of constraints: vertices in A are incident to at most one… (More)

- Ashwin Arulselvan, Ágnes Cseh, Jannik Matuschke
- ArXiv
- 2014

We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = (A∪̇P,E) with weights on the edges in E, and with lower and upper quotas on the vertices in P . We seek a maximum weight many-toone matching satisfying two sets of constraints: vertices in A are incident to at most one… (More)

- Ágnes Cseh
- SAGT
- 2014

The stable allocation problem is one of the broadest extensions of the well-known stable marriage problem. In an allocation problem, edges of a bipartite graph have capacities and vertices have quotas to fill. Here we investigate the case of uncoordinated processes in stable allocation instances. In this setting, a feasible allocation is given and the aim… (More)