SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A Lower Bound of 1+φ for Truthful Scheduling Mechanisms
16 references·4 citing·22 second hop
A Lower Bound of 1+φ for Truthful Scheduling Mechanisms (2012)A Lower Bound of 1+φ for Truthful Schedul…Algorithmic Game Theory: Quantifying the Inefficiency of Equilibria (2007)Algorithmic Game Theory: Quan…Algorithmic Game Theory: Computing in Games (2007)Algorithmic Game Theory: Comp…Algorithmic Game Theory (2007)Algorithmic Game TheoryTruthful randomized mechanisms for combinatorial auctions (2006)Truthful randomized mechanism…Weak monotonicity suffices for truthfulness on convex domains (2005)Weak monotonicity suffices fo…Approximation techniques for utilitarian mechanism design (2005)Approximation techniques for …Approximation algorithms for combinatorial auctions with complement-free bidders (2005)Approximation algorithms for …Towards a characterization of truthful combinatorial auctions (2004)Towards a characterization of…Incentive compatible multi unit combinatorial auctions (2003)Incentive compatible multi un…Truthful mechanisms for one-parameter agents (2001)Truthful mechanisms for one-p…Algorithmic Mechanism Design (2001)Algorithmic Mechanism DesignAlgorithmic mechanism design (extended abstract) (1999)Algorithmic mechanism design …Optimal Auction Design (1981)Optimal Auction DesignIncentives in Teams (1973)Incentives in TeamsMultipart pricing of public goods (1971)Multipart pricing of public g…COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)COUNTERSPECULATION, AUCTIONS,…Optimal collusion-resistant mechanisms with verification (2012)Optimal collusion-resistant m…Multi-unit auctions (2011)Multi-unit auctionsMechanism design for fractional scheduling on unrelated machines (2010)Mechanism design for fraction…An optimal lower bound for anonymous scheduling mechanisms (2009)An optimal lower bound for an…A Course in Game Theory (1994)Truth revelation in approximately efficient combinatorial auctions (2002)A survey on networking games in telecommunications (2004)Worst-case equilibria (2009)Social Choice and Individual Values. (1951)Truthful approximation mechanisms for restricted combinatorial auctions (2008)Approximate mechanism design without money (2009)A Theory of Auctions and Competitive Bidding (1982)Efficient mechanisms for bilateral trading (1983)The interdisciplinary study of coordination (1994)Computationally feasible VCG mechanisms (2000)Complexity of Mechanism Design (2002)Multi-parameter mechanism design and sequential posted pricing (2010)The Theory of Incentives: The Principal-Agent Model (2001)Putting Auction Theory to Work (2004)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)2. Public Goods: A Survey of Experimental Research (1995)Computational Aspects of Cooperative Game Theory (2012)Distributed Welfare Games (2013)Intrinsic Robustness of the Price of Anarchy (2015)Society-in-the-loop: programming the algorithmic social contract (2017)Agent-Based Modeling in Economics and Finance: Past, Present, and Future (2025)
this work references cited by second hop

References

  • 1961COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS7,719 cited
  • 1981Optimal Auction Design5,938 cited
  • 1973Incentives in Teams3,334 cited
  • 1971Multipart pricing of public goods3,266 cited
  • 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
  • 2001Truthful mechanisms for one-parameter agents521 cited
  • 1999Algorithmic mechanism design (extended abstract)478 cited
  • 2004Towards a characterization of truthful combinatorial auctions233 cited
  • 2003Incentive compatible multi unit combinatorial auctions193 cited
  • 2006Truthful randomized mechanisms for combinatorial auctions189 cited
  • 2005Weak monotonicity suffices for truthfulness on convex domains169 cited
  • 2005Approximation techniques for utilitarian mechanism design164 cited
  • 2005Approximation algorithms for combinatorial auctions with complement-free bidders164 cited

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

Cited by

  • 2012Optimal collusion-resistant mechanisms with verification32 cited
  • 2010Mechanism design for fractional scheduling on unrelated machines32 cited
  • 2011Multi-unit auctions31 cited
  • 2009An optimal lower bound for anonymous scheduling mechanisms30 cited