Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Two Randomized Mechanisms for Combinatorial Auctions

16 references·16 citing·32 second hopsampled

FromToDepth

this work references cited by second hop· second hop is a sample of the most-cited connections

References

2007Algorithmic Game Theory2,416 cited
2001Algorithmic Mechanism Design1,331 cited
2007Algorithmic Game Theory: Quantifying the Inefficiency of Equilibria1,114 cited
2007Algorithmic Game Theory: Computing in Games1,113 cited
1999Algorithmic mechanism design (extended abstract)478 cited
2000Computationally feasible VCG mechanisms325 cited
2005Internet and Network Economics318 cited
2007Introduction to Mechanism Design (for Computer Scientists)300 cited
2005The communication requirements of efficient allocations and supporting prices261 cited
2004Towards a characterization of truthful combinatorial auctions233 cited
2001Combinatorial auctions with decreasing marginal utilities230 cited
2005Truthful and Near-Optimal Mechanism Design via Linear Programming218 cited
2006Competitive auctions191 cited
2006Truthful randomized mechanisms for combinatorial auctions189 cited
2006On maximizing welfare when utility functions are subadditive164 cited
2005Approximation algorithms for combinatorial auctions with complement-free bidders

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

164 cited

Cited by

2017Gross substitutability: An algorithmic survey97 cited
2010Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders92 cited
2011An impossibility result for truthful combinatorial auctions with submodular valuations88 cited
2014Combinatorial Auctions via Posted Prices74 cited
2011Bayesian Incentive Compatibility via Fractional Assignments71 cited
2012The computational complexity of truthfulness in combinatorial auctions67 cited
2008On characterizations of truthful mechanisms for combinatorial auctions and scheduling66 cited
2012Budget Feasible Mechanism Design: From Prior-Free to Bayesian59 cited
2011From convex optimization to randomized mechanisms58 cited
2009Single-value combinatorial auctions and algorithmic implementation in undominated strategies58 cited
2009On the Power of Randomization in Algorithmic Mechanism Design58 cited
2011Welfare and Profit Maximization with Production Costs48 cited
2009On the Power of Randomization in Algorithmic Mechanism Design48 cited
2010Inapproximability for VCG-based combinatorial auctions48 cited
2012Budget feasible mechanism design44 cited
2012Online Mechanism Design (Randomized Rounding on the Fly)41 cited