Randomized algorithms for online bounded bidding

DOI10.1016/j.ipl.2010.03.016zbMath1233.68227OpenAlexW2090027528MaRDI QIDQ763539

Leah Epstein, Asaf Levin

Publication date: 12 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.03.016

zbMATH Keywords

competitive analysisonline algorithmsonline bidding

Mathematics Subject Classification ID

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

Related Items (1)

Improved bounds for randomized preemptive online matching

Cites Work

• Optimal online-list batch scheduling
• Incremental medians via online bidding
• A general approach for incremental approximation and hierarchical clustering
• On-line routing of virtual circuits with applications to load balancing and machine scheduling

This page was built for publication: Randomized algorithms for online bounded bidding