Large-scale quantum information processing requires the use of quantum e...
Matroid intersection is one of the most powerful frameworks of matroid t...
We consider the problem of finding a maximum popular matching in a
many-...
We consider a dynamic situation in the weighted bipartite matching probl...
The Stable Marriage problem (SM), solved by the famous deferred acceptan...
We consider the problem of random assignment of indivisible goods, in wh...
To mitigate the imbalance in the number of assignees in the
Hospitals/Re...
We provide a combinatorial study of split matroids, a class that was
mot...
We study how good a lexicographically maximal solution is in the weighte...
We present a polynomial-time 3/2-approximation algorithm for the
problem...
Motivated by a serious issue that hospitals in rural areas suffer from
s...
The notion of envy-freeness is a natural and intuitive fairness
requirem...
The present note is a strengthening of a recent paper by K. Takazawa and...
Let G=(V,E) be a multigraph with a set T⊆ V of terminals. A path
in G is...
Matchings and coverings are central topics in graph theory. The close
re...
We study a decentralized matching market in which firms sequentially mak...
We study a decentralized matching market in which each firm sequentially...