
Matchings and Copeland's Method
Given a graph G = (V,E) where every vertex has weak preferences over its...
read it

Maximum Matchings and Popularity
Let G be a bipartite graph where every node has a strict ranking of its ...
read it

Envyfree 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...
read it

Popular Branchings and Their Dual Certificates
Let G be a digraph where every node has preferences over its incoming ed...
read it

Quasipopular Matchings, Optimality, and Extended Formulations
Let G = (A ∪ B,E) be an instance of the stable marriage problem where ev...
read it

Understanding popular matchings via stable matchings
Let G = (A ∪ B, E) be an instance of the stable marriage problem with st...
read it

Popularity, stability, and the dominant matching polytope
Let G = (A ∪ B, E) be an instance of the stable marriage problem with st...
read it

Popular Matchings in Complete Graphs
Our input is a complete graph G = (V,E) on n vertices where each vertex ...
read it

Popular Matchings and Limits to Tractability
We consider popular matching problems in both bipartite and nonbipartit...
read it

The Popular Roommates problem
We consider the popular matching problem in a roommates instance with st...
read it

Maxsize popular matchings and extensions
We consider the maxsize popular matching problem in a roommates instanc...
read it
Telikepalli Kavitha
is this you? claim profile