Dynamic pricing for impatient bidders

DOI10.1145/1721837.1721851zbMath1300.91031OpenAlexW3136734724MaRDI QIDQ2930314

Neva Cherniavsky, Baruch Schieber, Atri Rurda, M. I. Sviridenko, Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rurda

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

online algorithmspricingdigital goods

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Offline and online algorithms for single-minded selling problem ⋮ Frequency capping in online advertising ⋮ Online pricing for bundles of multiple items

This page was built for publication: Dynamic pricing for impatient bidders