Showing cs.DMShow all
3 papers · 1 filter
cs.DM2026
An Algorithm for the Assignment Game Beyond Additive Valuations
Eric Balkanski, Christopher En, Yuri Faenza
The assignment game, introduced by Shapley and Shubik (1971), is a classic model for two-sided matching markets between buyers and sellers. In the original assignment game, it is a…
cs.DM2026
All finite lattices are stable matching lattices
Christopher En, Yuri Faenza
We show that all finite lattices, including non-distributive lattices, arise as stable matching lattices when all agents have path-independent choice functions. This result answers…
cs.DM2024
Scarf's Algorithm on Arborescence Hypergraphs
Karthekeyan Chandrasekaran, Yuri Faenza, Chengyue He +1
Scarf's algorithm--a pivoting procedure that finds a dominating extreme point in a down-monotone polytope--can be used to show the existence of a fractional stable matching in hype…