Finding a stable allocation in polymatroid intersection

DOI10.1137/1.9781611974331.CH73MaRDI QIDQ4575653zbMATH OpenOpenAlexFDO

Authors Satoru Iwata, Yu Yokoi

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

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

Recommendations

• Finding a stable allocation in polymatroid intersection
• Faster algorithms for stable allocation problems
• The integral stable allocation problem on graphs
• The Stable Allocation (or Ordinal Transportation) Problem
• Stable allocations and partially ordered sets

Cited in

(7)

• The integral stable allocation problem on graphs
• Polynomial time algorithm for an optimal stable assignment with multiple partners
• Stable allocations and partially ordered sets
• A note on a two-sided discrete-concave market with possibly bounded salaries
• Finding a stable allocation in polymatroid intersection
• Pareto stable matchings under one-sided matroid constraints
• A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments

This page was built for publication: Finding a stable allocation in polymatroid intersection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575653)