Scarf's algorithm and stable marriages

03/01/2023
by   Yuri Faenza, et al.
0

Scarf's algorithm gives a pivoting procedure to find a special vertex – a dominating vertex – in down-monotone polytopes. This paper studies the behavior of Scarf's algorithm when employed to find stable matchings in bipartite graphs. First, it proves that Scarf's algorithm can be implemented to run in polynomial time, showing the first positive result on its runtime in significant settings. Second, it shows an infinite family of instances where, no matter the pivoting rule and runtime, Scarf's algorithm outputs a matching from an exponentially small subset of all stable matchings, thus showing a structural weakness of the approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/05/2021

Finding Efficient Domination for P_8-Free Bipartite Graphs in Polynomial Time

A vertex set D in a finite undirected graph G is an efficient dominating...
research
08/10/2020

Finding Efficient Domination for S_1,3,3-Free Bipartite Graphs in Polynomial Time

A vertex set D in a finite undirected graph G is an efficient dominating...
research
06/15/2018

A Polynomial-Time Algorithm for (2-2/k)-stable Instances of the k-terminal cut Problem

The k-terminal cut problem is defined on an edge-weighted graph with k d...
research
08/01/2023

Minimum k-Hop Dominating Sets in Grid Graphs

Given a graph G, the k-hop dominating set problem asks for a vertex subs...
research
03/14/2021

Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs

Let G=(V(G),E(G)) be a finite simple undirected graph with vertex set V(...
research
10/09/2017

On Variants of Network Flow Stability

We present a variant of the stable flow problem. Instead of the traditio...
research
06/06/2011

Using More Data to Speed-up Training Time

In many recent applications, data is plentiful. By now, we have a rather...

Please sign up or login with your details

Forgot password? Click here to reset