SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
16 references·6 citing·28 second hop
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions (2005)Inapproximability Results for Combinatori…Combinatorial Auctions (2014)Combinatorial AuctionsTruthful randomized mechanisms for combinatorial auctions (2006)Truthful randomized mechanism…On maximizing welfare when utility functions are subadditive (2006)On maximizing welfare when ut…An improved approximation algorithm for combinatorial auctions with submodular bidders (2006)An improved approximation alg…The communication requirements of efficient allocations and supporting prices (2005)The communication requirement…Approximation algorithms for combinatorial auctions with complement-free bidders (2005)Approximation algorithms for …Incentive compatible multi unit combinatorial auctions (2003)Incentive compatible multi un…Bundling equilibrium in combinatorial auctions (2003)Bundling equilibrium in combi…An approximate truthful mechanism for combinatorial auctions with single parameter agents (2003)An approximate truthful mecha…Truth revelation in approximately efficient combinatorial auctions (2002)Truth revelation in approxima…Algorithm for optimal winner determination in combinatorial auctions (2002)Algorithm for optimal winner …Combinatorial auctions with decreasing marginal utilities (2001)Combinatorial auctions with d…The English Auction with Differentiated Commodities (2000)The English Auction with Diff…Walrasian Equilibrium with Gross Substitutes (1999)Walrasian Equilibrium with Gr…Truth Revelation in Rapid, Approximately Efficient Combinatorial Auctions (1999)Truth Revelation in Rapid, Ap…An Algorithm for Optimal Winner Determination in Combinatorial Auctions (1999)An Algorithm for Optimal Winn…The computational complexity of truthfulness in combinatorial auctions (2012)The computational complexity …From convex optimization to randomized mechanisms (2011)From convex optimization to r…An impossibility result for truthful combinatorial auctions with submodular valuations (2011)An impossibility result for t…Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders (2010)Approximation Algorithms for …Limitations of VCG-based mechanisms (2007)Limitations of VCG-based mech…On the computational power of iterative auctions (2005)On the computational power of…COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)Multipart pricing of public goods (1971)Incentives in Teams (1973)The Package Assignment Model (2002)An Efficient Dynamic Auction for Heterogeneous Commodities (2006)Computationally Manageable Combinational Auctions (1998)Towards a universal test suite for combinatorial auction algorithms (2000)Combinatorial auctions with decreasing marginal utilities (2005)Job Matching, Coalition Formation, and Gross Substitutes (1982)A Theory of Buyer-Seller Networks (2001)A Theory of Buyer-Seller Networks (2003)Optimal Auction Design (1981)Truthful approximation mechanisms for restricted combinatorial auctions (2008)Approximate mechanism design without money (2009)A Combinatorial Auction Mechanism for Airport Time Slot Allocation (1991)Analyzing the Airwaves Auction (1996)Integer programming for combinatorial auction winner determination (2002)The effect of false-name bids in combinatorial auctions: new fraud in internet auctions (2003)Economic theory of teams (1972)The Use of Knowledge in Society (1996)On the Hardness of Being Truthful (2008)Almost Envy-Freeness with General Valuations (2018)Approximation techniques for utilitarian mechanism design (2005)Weak monotonicity suffices for truthfulness on convex domains (2005)On profit-maximizing envy-free pricing (2005)What Have We Learned from Market Design? (2008)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)Computational Aspects of Cooperative Game Theory (2012)
this work references cited by second hop

References

  • 2014Combinatorial Auctions923 cited
  • 2002Algorithm for optimal winner determination in combinatorial auctions913 cited
  • 2002Truth revelation in approximately efficient combinatorial auctions658 cited
  • 1999Walrasian Equilibrium with Gross Substitutes624 cited
  • 1999An Algorithm for Optimal Winner Determination in Combinatorial Auctions325 cited
  • 2000The English Auction with Differentiated Commodities299 cited
  • 2005The communication requirements of efficient allocations and supporting prices261 cited
  • 2001Combinatorial auctions with decreasing marginal utilities230 cited
  • 1999Truth Revelation in Rapid, Approximately Efficient Combinatorial Auctions223 cited
  • 2003Incentive compatible multi unit combinatorial auctions193 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 bidders164 cited
  • 2006An improved approximation algorithm for combinatorial auctions with submodular bidders153 cited
  • 2003Bundling equilibrium in combinatorial auctions146 cited

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

  • 2003An approximate truthful mechanism for combinatorial auctions with single parameter agents125 cited
  • Cited by

    • 2010Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders92 cited
    • 2011An impossibility result for truthful combinatorial auctions with submodular valuations88 cited
    • 2012The computational complexity of truthfulness in combinatorial auctions67 cited
    • 2007Limitations of VCG-based mechanisms62 cited
    • 2011From convex optimization to randomized mechanisms58 cited
    • 2005On the computational power of iterative auctions56 cited