A universally-truthful approximation scheme for multi-unit auctions

DOI10.1016/J.GEB.2013.12.007MaRDI QIDQ1735729zbMATH OpenOpenAlexFDO

Authors Berthold Vöcking

Publication date 29 March 2019

Published in Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.geb.2013.12.007

zbMATH Keywords

mechanism designmulti-unit auctionsuniversal truthfulness

Mathematics Subject Classification ID

Randomized algorithms (68W20) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 7053320
• Truthful approximation mechanisms for restricted combinatorial auctions
• Energy Prosumers : Profiling the Energy Microgeneration Market In Lower Silesia, Poland
• scientific article; zbMATH DE number 2079341
• An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents
• A generic truthful mechanism for combinatorial auctions
• Truthful bundle/multiunit double auctions
• Randomized mechanisms for multi-unit auctions (extended abstract)
• Truth revelation in approximately efficient combinatorial auctions
• Truthful randomized mechanisms for combinatorial auctions

Cites work

• scientific article; zbMATH DE number 5343724 (Why is no real title available?)
• scientific article; zbMATH DE number 3670138 (Why is no real title available?)
• scientific article; zbMATH DE number 2079342 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 7053320 (Why is no real title available?)
• Approximation techniques for utilitarian mechanism design
• Black-box randomized reductions in algorithmic mechanism design
• Collusion-resistant mechanisms for single-parameter agents
• Discrete dynamic programming and capital allocation
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Mechanisms for multi-unit auctions
• Multi-unit auctions: beyond Roberts
• On the Power of Randomization in Algorithmic Mechanism Design
• Random knapsack in expected polynomial time
• The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
• Truthful and Near-Optimal Mechanism Design via Linear Programming
• Truthful approximation mechanisms for restricted combinatorial auctions
• Truthful implementation and preference aggregation in restricted domains
• Truthful randomized mechanisms for combinatorial auctions

Cited in

(8)

• The polyhedral geometry of truthful auctions
• On the power of randomization in algorithmic mechanism design
• Energy Prosumers : Profiling the Energy Microgeneration Market In Lower Silesia, Poland
• scientific article; zbMATH DE number 7053320 (Why is no real title available?)
• Approximation algorithms for a winner determination problem of single-item multi-unit auctions
• Multi-unit auctions: beyond Roberts
• Introduction to the special issue -- Algorithmic Game Theory -- STOC/FOCS/SODA 2012
• Mechanisms for multi-unit auctions

This page was built for publication: A universally-truthful approximation scheme for multi-unit auctions

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