#### Filter Results:

#### Publication Year

2013

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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)

In the Stable Marriage and Roommates problems, a set of agents is given, each of them having a strictly ordered preference list over some or all of the other agents. A matching is a set of disjoint pairs of mutually acceptable agents. If any two agents mutually prefer each other to their partner, then they block the matching, otherwise, the matching is said… (More)

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 the… (More)

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… (More)

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-to-one matching satisfying two sets of constraints: vertices in A are incident to at most one… (More)

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, egal d-sri, involves finding an egalitarian stable matching in solvable instances of sri with preference lists of length at most d. We… (More)

The stable allocation problem is a many-to-many generalization of the well-known stable marriage problem, where we seek a bipartite assignment between, say, jobs (of varying sizes) and machines (of varying capacities) that is " stable " based on a set of underlying preference lists submitted by the jobs and machines. Building on the initial work of [6], we… (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)

We are given a project-based university course, where our task is to assign students to suitable projects. In the Student/Project Allocation problem, or shortly spa, each student submits a weighted list of their acceptable projects, and likewise, a set of assignable students is given to each project. Moreover, some projects are equipped with upper and lower… (More)

- Ágnes Cseh
- ArXiv
- 2013

The stable marriage problem with its extensions is a widely studied subject. In this paper, we combine two topics related to it, setting up new and generalizing known results in both. The stable flow problem extends the well-known stable matching problem to network flows. Restricted edges have some special properties: forced edges must be in the stable… (More)

- ‹
- 1
- ›