Structured Preference Representation and Multiattribute Auctions
暂无分享,去创建一个
[1] Sébastien Lahaie,et al. An analysis of alternative slot auction designs for sponsored search , 2006, EC '06.
[2] Ronen I. Brafman,et al. UCP-Networks: A Directed Graphical Representation of Conditional Utilities , 2001, UAI.
[3] Rakesh K. Sarin,et al. Measurable Multiattribute Value Functions , 1979, Oper. Res..
[4] Subhash Suri,et al. Side constraints and non-price attributes in markets , 2006, Games Econ. Behav..
[5] Patrice Perny,et al. GAI Networks for Utility Elicitation , 2004, KR.
[6] Julian A. Padget,et al. Agent-Mediated Electronic Commerce IV. Designing Mechanisms and Systems , 2002, Lecture Notes in Computer Science.
[7] Peter C. Fishburn,et al. INTERDEPENDENCE AND ADDITIVITY IN MULTIVARIATE, UNIDIMENSIONAL EXPECTED UTILITY TIHEORY* , 1967 .
[8] W. M. Gorman. The Structure of Utility Functions , 1968 .
[9] Stefan Strecker,et al. Preference Revelation in Multi-Attribute Reverse English Auctions: A Laboratory Study , 2003, ICIS.
[10] Michael P. Wellman,et al. Bidding Strategies for Simultaneous Ascending Auctions , 2008 .
[11] Ross D. Shachter,et al. Dynamic programming and influence diagrams , 1990, IEEE Trans. Syst. Man Cybern..
[12] Martin Bichler,et al. Configurable offers and winner determination in multi-attribute auctions , 2005, Eur. J. Oper. Res..
[13] Michael P. Wellman,et al. AkBA: a progressive, anonymous-price combinatorial auction , 2000, EC '00.
[14] F. B. Vernadat,et al. Decisions with Multiple Objectives: Preferences and Value Tradeoffs , 1994 .
[15] Shobha Venkataraman,et al. Efficient Solution Algorithms for Factored MDPs , 2003, J. Artif. Intell. Res..
[16] Zoë Abrams,et al. Ad Auction Design and User Experience , 2007, WINE.
[17] David C. Parkes,et al. Preference elicitation in proxied multiattribute auctions , 2003, EC '03.
[18] D. Nilsson,et al. An efficient algorithm for finding the M most probable configurationsin probabilistic expert systems , 1998, Stat. Comput..
[19] Lawrence M. Ausubel,et al. Ascending Auctions with Package Bidding , 2002 .
[20] M. Rothkopf,et al. Why Are Vickrey Auctions Rare? , 1990, Journal of Political Economy.
[21] Craig Boutilier,et al. Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions , 2004, AAAI.
[22] Jeffrey K. MacKie-Mason,et al. Generalized Vickrey Auctions , 1994 .
[23] David C. Parkes,et al. Iterative combinatorial auctions: achieving economic and computational efficiency , 2001 .
[24] Glenn Ellison,et al. Position Auctions with Consumer Search , 2007 .
[25] Ralph L. Keeney,et al. Utility Independence and Preferences for Multiattributed Consequences , 1971, Oper. Res..
[26] Joachim Quantz. Modeling and Reasoning , 1991, Description Logics.
[27] M. Fisher,et al. A multiplier adjustment method for the generalized assignment problem , 1986 .
[28] Ali E. Abbas,et al. Attribute Dominance Utility , 2005, Decis. Anal..
[29] L. Wein,et al. An Inverse-Optimization-Based Auction Mechanism to Support a Multi-Attribute Rfq Process , 2001 .
[30] Patrice Perny,et al. GAI Networks for Decision Making under Certainty , 2005, IJCAI 2005.
[31] Jaap Van Brakel,et al. Foundations of measurement , 1983 .
[32] Judea Pearl,et al. Probabilistic reasoning in intelligent systems , 1988 .
[33] Michael P. Wellman,et al. Bid expressiveness and clearing algorithms in multiattribute double auctions , 2006, EC '06.
[34] Robert T. Clemen,et al. Making Hard Decisions: An Introduction to Decision Analysis , 1997 .
[35] F. Branco. The Design of Multidimensional Auctions , 1997 .
[36] D. M. Chickering,et al. Incorporating User Utility Into Sponsored-Search Auctions (Short Paper) , 2008 .
[37] Yeon-Koo Che. Design competition through multidimensional auctions , 1993 .
[38] P. Fishburn. The Foundations Of Expected Utility , 2010 .
[39] Yoav Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.
[40] Michael P. Wellman,et al. Preference representation for multi-unit multiattribute auctions , 2007, AAAI 2007.
[41] Phillip L. Carter,et al. The Role of Reverse Auctions in Strategic Sourcing , 2003 .
[42] Michel Gendreau,et al. Combinatorial auctions , 2007, Ann. Oper. Res..
[43] Ronen I. Brafman,et al. Introducing Variable Importance Tradeoffs into CP-Nets , 2002, UAI.
[44] Rina Dechter,et al. Bucket elimination: A unifying framework for probabilistic inference , 1996, UAI.
[45] David Levine,et al. CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions , 2005, Manag. Sci..
[46] David M. Pennock,et al. Revenue analysis of a family of ranking rules for keyword auctions , 2007, EC '07.
[47] Michael P. Wellman,et al. Evaluating the benefits of generalized additive representation in a multiattribute auction setting , 2008, AAAI 2008.
[48] M. Satterthwaite,et al. Efficient Mechanisms for Bilateral Trading , 1983 .
[49] Jason Shachat,et al. Procurement Auctions for Differentiated Goods , 2009, Decis. Anal..
[50] Noam Nisan,et al. Bidding and allocation in combinatorial auctions , 2000, EC '00.
[51] Martin Bichler,et al. Industrial Procurement Auctions , 2005 .
[52] Esther David,et al. An English Auction Protocol for Multi-attribute Items , 2002, AMEC.
[53] Craig Boutilier,et al. Bidding Languages for Combinatorial Auctions , 2001, IJCAI.
[54] M. Bichler. The Future of Emarkets: Multi-Dimensional Market Mechanisms , 2001 .
[55] Thomas Morris,et al. Reinventing the Supplier Negotiation Process at Motorola , 2005, Interfaces.
[56] Michael P. Wellman,et al. A Parametrization of the Auction Design Space , 2001, Games Econ. Behav..
[57] Nicholas R. Jennings,et al. Efficient mechanisms for the supply of services in multi-agent environments , 1998, ICE '98.
[58] Michael P. Wellman,et al. Generalized value decomposition and structured multiattribute auctions , 2007, EC '07.
[59] Ronen I. Brafman,et al. CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements , 2011, J. Artif. Intell. Res..
[60] Tuomas Sandholm,et al. Preference elicitation in combinatorial auctions , 2001, AAMAS '02.
[61] Yoav Shoham. A Symmetric View of Utilities and Probabilities , 1997, IJCAI.
[62] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[63] Rakesh K. Sarin,et al. RELATIVE RISK AVERSION. , 1982 .
[64] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[65] Eugene Fink,et al. Exchange Market for Complex Goods: Theory and Experiments , 2004 .
[66] Ronen I. Brafman,et al. Compact Value-Function Representations for Qualitative Preferences , 2004, UAI.
[67] B. Stengel,et al. Decomposition of multiattribute expected-utility functions , 1988 .
[68] Jaana Kekäläinen,et al. IR evaluation methods for retrieving highly relevant documents , 2000, SIGIR '00.
[69] E. Rowland. Theory of Games and Economic Behavior , 1946, Nature.
[70] Judea Pearl,et al. GRAPHOIDS: A Graph-based logic for reasoning about relevance relations , 1985 .
[71] Michael P. Wellman,et al. Market-Based Allocation with Indivisible Bids , 2005, AMEC@AAMAS/TADA@IJCAI.
[72] Daniel Lehmann,et al. Nearly optimal multi attribute auctions , 2005, EC '05.
[73] P. Fishburn. Methods of Estimating Additive Utilities , 1967 .
[74] Tuomas Sandholm. Expressive Commerce and Its Application to Sourcing: How We Conducted $35 Billion of Generalized Combinatorial Auctions , 2007, AI Mag..
[75] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[76] David Levine,et al. Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization , 2006, Interfaces.
[77] Ho Soo Lee,et al. Computational Aspects of Clearing Continuous Call Double Auctions with Assignment Constraints and Indivisible Demand , 2001, Electron. Commer. Res..
[78] John B. Kidd,et al. Decisions with Multiple Objectives—Preferences and Value Tradeoffs , 1977 .
[79] Carmel Domshlak,et al. Modeling and Reasoning about Preferences with CP-nets , 2002 .
[80] Fahiem Bacchus,et al. Graphical models for preference and utility , 1995, UAI.
[81] Lawrence M. Ausubel. An Efficient Ascending-Bid Auction for Multiple Objects , 2004 .
[82] Jianli Gong,et al. EXCHANGES FOR COMPLEX COMMODITIES: SEARCH FOR OPTIMAL MATCHES , 2002 .
[83] Moshe Tennenholtz,et al. An Algorithm for Multi-Unit Combinatorial Auctions , 2000, AAAI/IAAI.
[84] David Maxwell Chickering,et al. Incorporating user utility into sponsored-search auctions , 2008, AAMAS.
[85] Yoav Shoham,et al. Expected Utility Networks , 1999, UAI.
[86] Craig Boutilier,et al. Local Utility Elicitation in GAI Models , 2005, UAI.
[87] Michael P. Wellman,et al. Autonomous bidding agents - strategies and lessons from the trading agent competition , 2007 .
[88] O. Koppius. Information Architecture and Electronic Market Performance , 2002 .
[89] Martin Bichler,et al. An experimental analysis of multi-attribute auctions , 2000, Decis. Support Syst..
[90] G. Debreu. Topological Methods in Cardinal Utility Theory , 1959 .
[91] R. L. Keeney,et al. Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.
[92] Jonathan Barzilai,et al. On the foundations of measurement , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).
[93] M. Bohanec,et al. The Analytic Hierarchy Process , 2004 .
[94] Jon Doyle,et al. Modular utility representation for decision-theoretic planning , 1992 .
[95] Michael P. Wellman,et al. Multiattribute Call Markets , 2008 .
[96] Michael P. Wellman,et al. CUI Networks: A Graphical Representation for Conditional Utility Independence , 2006, AAAI.
[97] David C. Parkes,et al. Models for Iterative Multiattribute Procurement Auctions , 2005, Manag. Sci..
[98] Tilman Börgers,et al. Equilibrium Bids in Sponsored Search Auctions: Theory and Evidence , 2013 .
[99] N. Economides,et al. Electronic Call Market Trading , 1995 .
[100] Stefan Strecker,et al. Electronic sourcing with multi-attribute auctions , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.