Online Mechanism Design (Randomized Rounding on the Fly)
From MaRDI portal
Publication:3167050
DOI10.1007/978-3-642-31585-5_56zbMath1367.91080OpenAlexW95009287MaRDI QIDQ3167050
Berthold Vöcking, Piotr Krysta
Publication date: 1 November 2012
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31585-5_56
Auctions, bargaining, bidding and selling, and other market models (91B26) Online algorithms; streaming algorithms (68W27)
Related Items (9)
Online crowdsourced truck delivery using historical information ⋮ Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions ⋮ Optimal item pricing in online combinatorial auctions ⋮ Combinatorial auctions without money ⋮ Truthful mechanism design via correlated tree rounding ⋮ Mechanism design for perturbation stable combinatorial auctions ⋮ Algorithms as Mechanisms: The Price of Anarchy of Relax and Round ⋮ Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders ⋮ Online generalized assignment problem with historical information
This page was built for publication: Online Mechanism Design (Randomized Rounding on the Fly)
