We consider the Shortest Odd Path problem, where given an undirected gra...
We consider the following problem that we call the Shortest Two Disjoint...
A preference system ℐ is an undirected graph where vertices have
prefere...
We present some reductions between optimization problems for undirected
...
In a graph where vertices have preferences over their neighbors, a match...
We consider a matching problem in a bipartite graph G=(A∪ B,E) where
eac...
We study housing markets as introduced by Shapley and Scarf (1974). We
i...
Let G be a digraph where every node has preferences over its incoming
ed...
Efficient computability is an important property of solution concepts in...
We consider the following control problem on fair allocation of indivisi...