Randomized algorithms for online bounded bidding

DOI10.1016/J.IPL.2010.03.016MaRDI QIDQ763539zbMATH OpenOpenAlexFDO

Authors 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

online algorithmscompetitive analysisonline bidding

Mathematics Subject Classification ID

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

Recommendations

• Randomized Competitive Analysis for Two-Server Problems
• Randomized competitive analysis for two server problems
• On randomization in on-line computation.
• Online pricing with impatient bidders
• On the power of randomization in on-line algorithms

Cites work

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

Cited in

(7)

• Oblivious Medians Via Online Bidding
• Improved bounds for randomized preemptive online matching
• On bidding algorithms for a distributed combinatorial auction
• Randomized Online Algorithms with High Probability Guarantees
• scientific article; zbMATH DE number 5991658 (Why is no real title available?)
• Exact algorithms for the matrix bid auction
• A multiple-choice secretary algorithm with applications to online auctions

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

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