Finding a Stable Allocation in Polymatroid Intersection

DOI10.1137/1.9781611974331.ch73zbMath1410.05018OpenAlexW4248278616MaRDI QIDQ4575653

Yu Yokoi, Satoru Iwata

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch73

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (3)

Finding a Stable Allocation in Polymatroid Intersection ⋮ A Note on a Two-Sided Discrete-Concave Market with Possibly Bounded Salaries ⋮ Pareto Stable Matchings under One-Sided Matroid Constraints

This page was built for publication: Finding a Stable Allocation in Polymatroid Intersection