Zobrazeno 1 - 3
of 3
pro vyhledávání: '"HV, Vishwa Prakash"'
We formulate the problem of fair and efficient completion of indivisible goods, defined as follows: Given a partial allocation of indivisible goods among agents, does there exist an allocation of the remaining goods (i.e., a completion) that satisfie
Externí odkaz:
http://arxiv.org/abs/2406.09468
Allocation of scarce healthcare resources under limited logistic and infrastructural facilities is a major issue in the modern society. We consider the problem of allocation of healthcare resources like vaccines to people or hospital beds to patients
Externí odkaz:
http://arxiv.org/abs/2303.11053
We show that given a SM instance G as input we can find a largest collection of pairwise edge-disjoint stable matchings of G in time linear in the input size. This extends two classical results: 1. The Gale-Shapley algorithm, which can find at most t
Externí odkaz:
http://arxiv.org/abs/2011.13248