A Theory of Expressiveness in Mechanisms
暂无分享,去创建一个
[1] Balázs Szentes,et al. Beyond chopsticks: Symmetric equilibria in majority auction games , 2003, Games Econ. Behav..
[2] Peter W. Glynn,et al. A Nonparametric Approach to Multiproduct Pricing , 2006, Oper. Res..
[3] Tuomas Sandholm. Expressive Commerce and Its Application to Sourcing: How We Conducted $35 Billion of Generalized Combinatorial Auctions , 2007, AI Mag..
[4] Lujo Bauer,et al. User-Controllable Security and Privacy for Pervasive Computing , 2007 .
[5] HohnerGail,et al. Combinatorial and quantity-discount procurement auctions benefit Mars, incorporated and its suppliers , 2003 .
[6] Tuomas Sandholm,et al. Expressive commerce and its application to sourcing: how we conducted $35 billion of generalized combinatorial auctions , 2007, AI Mag..
[7] David C. Parkes,et al. Price-Based Information Certificates for Minimal-Revelation Combinatorial Auctions , 2002, AMEC.
[8] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[9] S. Reiter,et al. The informational size of message spaces , 1974 .
[10] Chris Anderson,et al. The Long Tail: Why the Future of Business is Selling Less of More , 2006 .
[11] Haitao Zheng,et al. A General Framework for Wireless Spectrum Auctions , 2007, 2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks.
[12] Richard S. Varga,et al. Proof of Theorem 6 , 1983 .
[13] Ho Soo Lee,et al. Special Issue: 2002 Franz Edelman Award for Achievement in Operations Research and the Management Sciences: Combinatorial and Quantity-Discount Procurement Auctions Benefit Mars, Incorporated and Its Suppliers , 2003, Interfaces.
[14] Robert W. Rosenthal,et al. Simultaneous Auctions with Synergies and Common Values , 1996 .
[15] Tuomas Sandholm,et al. Methods for Boosting Revenue in Combinatorial Auctions , 2004, AAAI.
[16] Lujo Bauer,et al. User-Controllable Security and Privacy for Pervasive Computing , 2007, Eighth IEEE Workshop on Mobile Computing Systems and Applications.
[17] Amir Ronen,et al. Mechanism design with incomplete languages , 2001, EC '01.
[18] K. Arrow. The Property Rights Doctrine and Demand Revelation under Incomplete Information**This work was supported by National Science Foundation under Grant No. SOC75-21820 at the Institute for Mathematical Studies in the Social Sciences, Stanford University. , 1979 .
[19] Craig Boutilier,et al. Expressive Banner Ad Auctions and Model-Based Online Optimization for Clearing , 2008, AAAI.
[20] B. Moldovanu,et al. Efficient Design with Interdependent Valuations , 2001 .
[21] S. Bikhchandani,et al. Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation , 2006 .
[22] K. B. Monroe,et al. How Buyers Perceive Savings in a Bundle Price: An Examination of a Bundle's Transaction Value: , 1993 .
[23] Richard S. Varga,et al. Proof of Theorem 5 , 1983 .
[24] L. Hurwicz. On informationally decentralized systems , 1977 .
[25] Tuomas Sandholm,et al. Preference elicitation in combinatorial auctions , 2001, AAMAS '02.
[26] David Levine,et al. Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization , 2006, Interfaces.
[27] Peter R. Wurman,et al. Structural leverage and fictitious play in sequential auctions , 2002, AAAI/IAAI.
[28] Thomas G. Dietterich. What is machine learning? , 2020, Archives of Disease in Childhood.
[29] Stanley Reiter,et al. Designing Economic Mechanisms , 2006 .
[30] Janet L. Yellen,et al. Commodity Bundling and the Burden of Monopoly , 1976 .
[31] Fabien L. Gandon,et al. Ambient Intelligence: The MyCampus Experience , 2005 .
[32] Moshe Tennenholtz,et al. Bundling equilibrium in combinatorial auctions , 2002, Games Econ. Behav..
[33] Yoav Shoham,et al. Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.
[34] Eyal Kushilevitz,et al. Communication Complexity , 1997, Adv. Comput..
[35] M. Satterthwaite,et al. Efficient Mechanisms for Bilateral Trading , 1983 .
[36] Michal Feldman,et al. Implementation with a bounded action space , 2006, EC '06.
[37] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[38] Noam Nisan,et al. The communication requirements of efficient allocations and supporting prices , 2006, J. Econ. Theory.
[39] Thomas Marschak,et al. Discrete allocation mechanisms: Dimensional requirements for resource-allocation mechanisms when desired outcomes are unbounded , 1985, J. Complex..
[40] Yannis Bakos,et al. Bundling Information Goods: Pricing, Profits and Efficiency , 1998 .
[41] Shmuel S. Oren,et al. Optimal Bidding in Sequential Auctions , 1975, Oper. Res..
[42] Jennifer Wortman Vaughan,et al. Sponsored Search with Contexts , 2007, WINE.
[43] C. Avery,et al. Bundling and Optimal Auctions of Multiple Products , 2000 .
[44] Noam Nisan,et al. Computationally feasible VCG mechanisms , 2000, EC '00.
[45] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[46] Jim Wilenius,et al. Discovering Equilibrium Strategies for a Combinatorial First Price Auction , 2007, The 9th IEEE International Conference on E-Commerce Technology and The 4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services (CEC-EEE 2007).
[47] Noam Nisany,et al. The Communication Requirements of E¢cient Allocations and Supporting Lindahl Prices¤ , 2003 .
[48] Subhash Suri,et al. Side constraints and non-price attributes in markets , 2006, Games Econ. Behav..
[49] M. Whinston,et al. Multiproduct Monopoly, Commodity Bundling, and Correlation of Values , 1989 .
[50] Vincent A. Mabert,et al. The use of bundling in B2B online reverse auctions , 2008 .
[51] A. Mas-Colell,et al. Microeconomic Theory , 1995 .
[52] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[53] Ward Hanson,et al. Optimal bundle pricing , 1990 .
[54] Lorrie Faith Cranor,et al. Understanding and Capturing People’s Privacy Policies in a People Finder Application , 2008 .
[55] Thomas R. Palfrey,et al. Bundling Decisions by a Multiproduct Monopolist with Incomplete Information , 1983 .
[56] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[57] Rajeev Motwani,et al. Algorithms for Multi-product Pricing , 2004, ICALP.
[58] Paul Milgrom,et al. Simplified mechanisms with an application to sponsored-search auctions , 2010, Games Econ. Behav..
[59] Thomas Morris,et al. Reinventing the Supplier Negotiation Process at Motorola , 2005, Interfaces.
[60] Leonard M. Adleman,et al. Proof of proposition 3 , 1992 .
[61] Vincent Conitzer,et al. Combinatorial Auctions with k-wise Dependent Valuations , 2005, AAAI.
[62] K. Taira. Proof of Theorem 1.3 , 2004 .
[63] Maria-Florina Balcan,et al. Approximation algorithms and online mechanisms for item pricing , 2006, EC '06.
[64] J. Guiltinan. The Price Bundling of Services: A Normative Framework , 1987 .
[65] E. Durfee,et al. Toward Automated Pricing and Bundling of Information Goods , 2000 .
[66] Rajarshi Das,et al. Pricing information bundles in a dynamic environment , 2001, EC '01.
[67] Craig Boutilier,et al. Automated Channel Abstraction for Advertising Auctions , 2010, AAAI.
[68] Vincent Conitzer,et al. Self-interested automated mechanism design and implications for optimal combinatorial auctions , 2004, EC '04.
[69] Vincent Conitzer,et al. Complexity of Mechanism Design , 2002, UAI.
[70] G. Stigler. United States v. Loew's Inc.: A Note on Block-Booking , 1963, The Supreme Court Review.
[71] Tuomas Sandholm,et al. Approximating Revenue-Maximizing Combinatorial Auctions , 2005, AAAI.
[72] Richard Schmalensee,et al. Gaussian Demand and Commodity Bundling , 1984 .
[73] M. Armstrong. Optimal Multi-Object Auctions , 2000 .
[74] Paul Milgrom,et al. Simplified Mechanisms with Applications to Sponsored Search and Package Auctions , 2007 .
[75] Philip M. Long,et al. Characterizations of Learnability for Classes of {0, ..., n}-Valued Functions , 1995, J. Comput. Syst. Sci..
[76] Victor Naroditskiy,et al. Using Iterated Best-Response to Find Bayes-Nash Equilibria in Auctions , 2007, AAAI.
[77] Philippe Jehiel,et al. Mixed Bundling Auctions , 2006, J. Econ. Theory.
[78] Venkatesan Guruswami,et al. On profit-maximizing envy-free pricing , 2005, SODA '05.
[79] M. Armstrong. Multiproduct Nonlinear Pricing , 1996 .
[80] Tuomas Sandholm,et al. Preference elicitation in combinatorial auctions , 2002, EC '01.
[81] Felix Schlenk,et al. Proof of Theorem 3 , 2005 .
[82] F. Hayek. The economic nature of the firm: The use of knowledge in society , 1945 .
[83] Erik Vee,et al. Cost of Conciseness in Sponsored Search Auctions , 2007, WINE.
[84] S. Rassenti,et al. A Combinatorial Auction Mechanism for Airport Time Slot Allocation , 1982 .
[85] Norman M. Sadeh,et al. Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions , 2009, IJCAI.
[86] E. H. Clarke. Multipart pricing of public goods , 1971 .
[87] M. Whinston,et al. Menu Auctions, Resource Allocation, and Economic Influence , 1986 .
[88] Theodore Groves,et al. Incentives in Teams , 1973 .
[89] C. d'Aspremont,et al. Incentives and incomplete information , 1979 .