2011 · 65 citations · 17 references
BusinessEconomicsAuction TheoryDecision TheoryOptimizationAuction DesignCombinatorial AuctionsMechanism DesignProcurementProcurement AuctionsBudget Feasibility AnalysisOptimal Procurement MechanismsTruthful Mechanism DesignTruthful Mechanisms
We study procurement auctions when the buyer has complement-free (subadditive) objectives in the budget feasibility model (Singer 2010). For general subadditive functions we give a randomized universally truthful mechanism which is an O(log2 n) approximation, and an O(log3 n) deterministic truthful approximation mechanism; both mechanisms are in the demand oracle model. For cut functions, an interesting case of nonincreasing objectives, we give both randomized and deterministic truthful and budget feasible approximation mechanisms that achieve a constant approximation factor.
17
Roger B. Myerson · Mathematics of Operations Research · 1981 · 6.1K citations
Noam Nisan, Amir Ronen · Games and Economic Behavior · 2001 · 1.4K citations
Yaron Singer · 2010 · 302 citations
Arpita Ghosh, Aaron Roth · 2011 · 264 citations
A BGP-based mechanism for lowest-cost routing
Joan Feigenbaum, Christos H. Papadimitriou, Rahul Sami et al. · 2002 · 211 citations