Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Elliot Anshelevich, Wennan Zhu. Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching. In Vittorio Bilò, Michele Flammini, editors, Algorithmic Game Theory - 10th International Symposium, SAGT 2017, L'Aquila, Italy, September 12-14, 2017, Proceedings. Volume 10504 of Lecture Notes in Computer Science, pages 267-279, Springer, 2017. [doi]

The following publications are possibly variants of this publication:

Tradeoffs Between Information and Ordinal Approximation for Bipartite MatchingElliot Anshelevich, Wennan Zhu. mst, 63(7):1499-1530, 2019. [doi]

Matching, social welfare and ordinal approximationWennan Zhu. PhD thesis, Rensselaer Polytechnic Institute, USA, 2020. [doi]

Ordinal approximation in matching and social choiceElliot Anshelevich. sigecom, 15(1):60-64, 2016. [doi]

runs on WebDSL