• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

A Theory of Expressiveness in Mechanisms (2007)

Cached

  • Download as a PDF

Download Links

  • [www.cs.cmu.edu]
  • [www.casos.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.scs.cmu.edu]
  • [www.cs.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Michael Benisch , Norman Sadeh , Tuomas Sandholm
Citations:15 - 9 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Benisch07atheory,
    author = {Michael Benisch and Norman Sadeh and Tuomas Sandholm},
    title = {A Theory of Expressiveness in Mechanisms},
    year = {2007}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

A key trend in the world—especially in electronic commerce—is a demand for higher levels of expressiveness in the mechanisms that mediate interactions, such as the allocation of resources, matching of peers, and elicitation of opinions from large and diverse communities. Intuitively, one would think that this increase in expressiveness would lead to more efficient mechanisms (e.g., due to better matching of supply and demand). However, until now we have lacked a general way of characterizing the expressiveness of these mechanisms, analyzing how it impacts the actions taken by rational agents—and ultimately the outcome of the mechanism. In this technical report we introduce a general model of expressiveness for mechanisms. Our model is based on a new measure which we refer to as the maximum impact dimension. The measure captures the number of different ways that an agent can impact the outcome of a mechanism. We proceed to uncover a fundamental connection between this measure and the concept of shattering from computational learning theory. We also provide a way to determine an upper bound on the expected efficiency of any mechanism under its most efficient Nash equilibrium which, remarkably, depends only on the mechanism’s expressiveness. We show that for any setting and any prior over agent preferences, the

Citations

954 Counterspeculation, Auctions, and Competitive Sealed Tenders - Vickrey - 1961
816 On the uniform convergence of relative frequencies of events to their probabilities. Theory of Prob. and its - Vapnik, Chervonenkis - 1971
565 Learnability and the Vapnik Chervonenkis dimension - Blumer, Ehrenfeucht, et al. - 1989
556 Multipart pricing of public goods - CLARKE - 1971
459 Algorithm for optimal winner determination in combinatorial auctions - SANDHOLM
441 Incentives in Teams - GROVES - 1973
238 Simultaneous ascending auctions - Cramton - 2006
231 The Use of Knowledge in Society - Hayek - 1945
166 Computationally feasible vcg mechanisms - Nisan, Ronen
122 The Long Tail: Why the Future of Business is Selling Less of More. Hyperion - Anderson
108 Complexity of mechanism design - Conitzer, Sandholm
100 The communication requirements of efficient allocations and supporting prices - Nisan, Segal
99 Multipart pricing of public goods,” Public Choice - Clarke - 1971
87 Menu auctions, resource allocation and economic influence - Bernheim, Whinston - 1986
78 Commodity bundling and the burden of monopoly, Quarterly - Adams, Yellen - 1976
75 On profitmaximizing envy-free pricing - Guruswami, Hartline, et al. - 2005
71 Multiproduct Nonlinear Pricing - Armstrong - 1996
70 Multiproduct monopoly, commodity bundling and the correlation of values, Quarterly - McAfee, McMillan, et al. - 1989
67 Bundling information goods: Pricing, profits and efficiency - Bakos, Brynjolfsson - 1999
59 On Informationally Decentralized Systems - Hurwicz - 1977
57 Efficient Design with Interdependent Valuations - Jehiel, Moldovanu - 2001
48 Approximation algorithms and online mechanisms for item pricing - Balcan, Blum - 2006
41 Expressive commerce and its application to sourcing: How we conducted 35 billion of generalized combinatorial auctions - Sandholm
40 Bundling equilibrium in combinatorial auctions - Holzman, Kfir-Dahav, et al.
40 Bundling Decisions by a Multiproduct Monopolist with Incomplete Information,” Econometrica - Palfrey - 1983
38 The information size of message spaces - Mount, Reiter - 1974
37 Gaussian demand and commodity bundling - Schmalensee - 1984
35 Side constraints and nonprice attributes in markets - Sandholm, Suri - 2006
30 Approximating revenue-maximizing combinatorial auctions - Likhodedov, Sandholm - 2005
25 Price-based information certificates for minimal-revelation combinatorial auctions, in - Parkes - 2002
23 Self-interested automated mechanism design and implications for optimal combinatorial auctions - Conitzer, Sandholm - 2004
23 User-Controllable Security and Privacy for Pervasive Computing - Cornwell
23 A non-parametric approach to multi-product pricing: theory and application - Rusmeivhichientong, Roy, et al.
22 Combinatorial Auctions with k-wise Dependent Valuations - Conitzer, Sandholm, et al. - 2005
22 Simultaneous auctions with synergies and common values’, Games and Economic Behavior 17 - Rosenthal, Wang - 1996
21 Ueber eine elementare Frage der Mannigfaltigkeitslehre - Cantor
21 Methods for boosting revenue in combinatorial auctions - Likhodedov, Sandholm - 2004
20 Ambient intelligence: The mycampus experience - Sadeh, Gandom, et al. - 2005
17 Combinatorial and quantity-discount procurement auctions benefit Mars, Incorporated and its suppliers - Hohner, Rich, et al. - 2003
16 The price bundling of services: A normative framework - Guiltinan - 1987
14 Simplified mechanisms with an application to sponsored-search auctions - Milgrom - 2010
14 Changing the game in strategic sourcing at Procter & Gamble: Expressive competition enabled by optimization - Sandholm, Levine, et al.
14 Expressive Banner Ad Auctions and Model-Based Online Optimization for Clearing - Boutilier, Parkes, et al. - 2008
13 Implementation with a bounded action space - Blumrosen, Feldman - 2006
13 Sponsored search with contexts - Even-Dar, Kearns, et al. - 2007
12 Characterizations of learnability for classes of {0...n}-valued functions - Ben-David, Cesa-Bianchi, et al. - 1995
10 United States v. Loew's Inc.: A Note on Block-Booking. The Supreme Court Review - Stigler - 1963
9 Cost of conciseness in sponsored search auctions - Abrams, Ghosh, et al. - 2007
9 Optimal Bidding in Sequential Auctions - Oren, Rothkopf - 1975
8 Mechanism design with incomplete languages - Ronen - 2001
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University