Online algorithms for market clearing

DOI10.1145/1183907.1183913zbMath1326.91010OpenAlexW2022427910MaRDI QIDQ3455219

Martin Zinkevich, Tuomas W. Sandholm, Avrim L. Blum

Publication date: 4 December 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1183907.1183913

zbMATH Keywords

competitive analysisonline algorithmsdouble auctionsexchanges

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm ⋮ Online spatio-temporal matching in stochastic and dynamic domains ⋮ Pricing and allocation algorithm designs in dynamic ridesharing system ⋮ How to allocate goods in an online market?

This page was built for publication: Online algorithms for market clearing