Black-Box Randomized Reductions in Algorithmic Mechanism Design
From MaRDI portal
Publication:5419042
DOI10.1137/110843654zbMath1301.68158OpenAlexW2139692878MaRDI QIDQ5419042
Tim Roughgarden, Shaddin Dughmi
Publication date: 4 June 2014
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110843654
Analysis of algorithms and problem complexity (68Q25) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)
Related Items (11)
Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem ⋮ Algorithmic Mechanism Design for Collaboration in Large-Scale Transportation Networks ⋮ A universally-truthful approximation scheme for multi-unit auctions ⋮ Network pollution games ⋮ Bayesian incentive compatibility via matchings ⋮ New Results for Network Pollution Games ⋮ Black-Box Reductions in Mechanism Design ⋮ Algorithms as Mechanisms: The Price of Anarchy of Relax and Round ⋮ On black-box transformations in downward-closed environments ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Black-Box Randomized Reductions in Algorithmic Mechanism Design
