An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem

DOI10.1137/1.9781611975482.120zbMath1432.68592arXiv2103.03193OpenAlexW3135821699MaRDI QIDQ5236306

Rebecca Reiffenhäuser

Publication date: 15 October 2019

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

Full work available at URL: https://arxiv.org/abs/2103.03193

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Auctions, bargaining, bidding and selling, and other market models (91B26) Online algorithms; streaming algorithms (68W27) Mechanism design theory (91B03)

Related Items (2)

The secretary recommendation problem ⋮ Truthful Matching with Online Items and Offline Agents

This page was built for publication: An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem