Most algorithmic matches in fielded kidney exchanges do not result in an actual transplant.
In this paper, we address the problem of cycles and chains in a proposed match failing after …

The preferred treatment for kidney failure is a transplant; however, demand for donor
kidneys far outstrips supply. Kidney exchange, an innovation where willing but incompatible …

Kidney exchange programs aim at matching end-stage renal disease patients who have a
willing but incompatible kidney donor with another donor. The programs comprise a pool of …

The stochastic matching problem deals with finding a maximum matching in a graph whose
edges are unknown but can be accessed via queries. This is a special case of stochastic k …

Managing perishable inventory, such as blood stock awaiting use by patients in need, has
been a topic of research for decades. This has been investigated across several disciplines …

Abstract We consider the One-Sided Matching problem, where n agents have preferences
over n items, and these preferences are induced by underlying cardinal valuation functions …

We study the stochastic matching problem with the goal of finding a maximum matching in a
graph whose edges are unknown but can be accessed via queries. This is a special case of …

It is a long-standing problem to lower bound the performance of randomized greedy
algorithms for maximum matching. Aronson, Dyer, Frieze and Suen [1] studied the modified …

We revisit the problem of designing optimal, individually rational matching mechanisms (in a
general sense, allowing for cycles in directed graphs), where each player—who is …

There has been a long history of studying randomized greedy matching algorithms since the
work by Dyer and Frieze. We follow this trend and consider the problem formulated in the …