SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Costly valuation computation in auctions
9 references·8 citing·37 second hop
Costly valuation computation in auctions (2001)Costly valuation computation in auctionsCABOB: a fast optimal algorithm for combinatorial auctions (2001)CABOB: a fast optimal algorit…Issues in Computational Vickrey Auctions (2000)Issues in Computational Vickr…Computationally feasible VCG mechanisms (2000)Computationally feasible VCG …Truth Revelation in Rapid, Approximately Efficient Combinatorial Auctions (1999)Truth Revelation in Rapid, Ap…Modeling Bounded Rationality (1998)Modeling Bounded RationalityEfficient Computation of Equilibria for Extensive Two-Person Games (1996)Efficient Computation of Equi…Auctions and Bidding: A Primer (1989)Auctions and Bidding: A PrimerIncentives in Teams (1973)Incentives in TeamsMultipart pricing of public goods (1971)Multipart pricing of public g…Algorithmic rationality: Game theory with costly computation (2014)Algorithmic rationality: Game…On the Computational Power of Demand Queries (2009)On the Computational Power of…Strategic Implications of Uncertainty over One's Own Private Value in Auctions (2006)Strategic Implications of Unc…Sequences of take-it-or-leave-it offers (2006)Sequences of take-it-or-leave…Combinatorial auctions with k-wise dependent valuations (2005)Combinatorial auctions with k…Auction design with costly preference elicitation (2005)Auction design with costly pr…Computational criticisms of the revelation principle (2004)Computational criticisms of t…Partial-revelation VCG mechanism for combinatorial auctions (2002)Partial-revelation VCG mechan…A Combinatorial Auction Mechanism for Airport Time Slot Allocation (1991)Computationally Manageable Combinational Auctions (1998)BOB: Improved winner determination in combinatorial auctions and generalizations (2003)Bundling equilibrium in combinatorial auctions (2003)Combinatorial Auctions: A Survey (2003)The communication requirements of efficient allocations and supporting prices (2005)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)A Theory of Auctions and Competitive Bidding (1982)Auctions with Severely Bounded Communication (2007)Information in Mechanism Design (2008)Assignment Messages and Exchanges (2009)A Course in Game Theory (1994)Complexity Results about Nash Equilibria (2002)Towards a characterization of truthful combinatorial auctions (2004)Truthful approximation mechanisms for restricted combinatorial auctions (2008)Design Competition Through Multidimensional Auctions (1993)Selling Spectrum Rights (1994)Bidding and allocation in combinatorial auctions (2000)American Economic Review (2019)Equilibrium Points of Bimatrix Games (1964)Nash and correlated equilibria: Some complexity considerations (1989)Efficient Computation of Behavior Strategies (1996)Complexity of Mechanism Design (2002)New complexity results about Nash equilibria (2008)Optimal Auction Design (1981)On profit-maximizing envy-free pricing (2005)Approximate mechanism design without money (2009)Global Capital and National Governments (2001)Playing large games using simple strategies (2003)How voters decide: information processing during election campaigns (2007)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)eMediator: A Next Generation Electronic Commerce Server (2002)Automated Mechanism Design: A New Application Area for Search Algorithms (2003)Auctions, Bidding and Exchange Design (2004)
this work references cited by second hop

References

  • 1973Incentives in Teams3,334 cited
  • 1971Multipart pricing of public goods3,266 cited
  • 1989Auctions and Bidding: A Primer851 cited
  • 1998Modeling Bounded Rationality657 cited
  • 2000Computationally feasible VCG mechanisms325 cited
  • 1996Efficient Computation of Equilibria for Extensive Two-Person Games228 cited
  • 1999Truth Revelation in Rapid, Approximately Efficient Combinatorial Auctions223 cited
  • 2001CABOB: a fast optimal algorithm for combinatorial auctions206 cited
  • 2000Issues in Computational Vickrey Auctions115 cited

Cited by

  • 2005Auction design with costly preference elicitation78 cited
  • 2014Algorithmic rationality: Game theory with costly computation69 cited
  • 2006Strategic Implications of Uncertainty over One's Own Private Value in Auctions66 cited
  • 2004Computational criticisms of the revelation principle63 cited
  • 2002Partial-revelation VCG mechanism for combinatorial auctions61 cited
  • 2009On the Computational Power of Demand Queries56 cited
  • 2005Combinatorial auctions with k-wise dependent valuations

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

52 cited
  • 2006Sequences of take-it-or-leave-it offers48 cited