research
∙
07/12/2022
Popular Matchings with One-Sided Bias
Let G = (A ∪ B,E) be a bipartite graph where the set A consists of agent...
share
research
∙
10/21/2021
The popular assignment problem: when cardinality is more important than popularity
We consider a matching problem in a bipartite graph G=(A∪ B,E) where eac...
research
∙
05/28/2021
Matchings and Copeland's Method
Given a graph G = (V,E) where every vertex has weak preferences over its...
research
∙
11/06/2020
Maximum Matchings and Popularity
Let G be a bipartite graph where every node has a strict ranking of its ...
research
∙
06/08/2020
Envy-free Relaxations for Goods, Chores, and Mixed Items
In fair division problems, we are given a set S of m items and a set N o...
research
∙
12/04/2019
Popular Branchings and Their Dual Certificates
Let G be a digraph where every node has preferences over its incoming ed...
research
∙
04/11/2019
Quasi-popular Matchings, Optimality, and Extended Formulations
Let G = (A ∪ B,E) be an instance of the stable marriage problem where ev...
research
∙
11/16/2018
Understanding popular matchings via stable matchings
Let G = (A ∪ B, E) be an instance of the stable marriage problem with st...
research
∙
11/16/2018
Popularity, stability, and the dominant matching polytope
Let G = (A ∪ B, E) be an instance of the stable marriage problem with st...
research
∙
07/03/2018
Popular Matchings in Complete Graphs
Our input is a complete graph G = (V,E) on n vertices where each vertex ...
research
∙
05/26/2018
Popular Matchings and Limits to Tractability
We consider popular matching problems in both bipartite and non-bipartit...
research
∙
03/31/2018
The Popular Roommates problem
We consider the popular matching problem in a roommates instance with st...
research
∙
02/21/2018