Combinatorial auctions with decreasing marginal utilities
暂无分享,去创建一个
[1] Sven de Vries,et al. Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..
[2] Zaifu Yang,et al. A Note on Kelso and Crawford's Gross Substitutes Condition , 2003, Math. Oper. Res..
[3] Sushil Bikhchandani,et al. The Package Assignment Model , 2002, J. Econ. Theory.
[4] Moshe Tennenholtz,et al. Tractable combinatorial auctions and b-matching , 2002, Artif. Intell..
[5] Y. Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, JACM.
[6] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[7] Brenda L Dietrich,et al. Mathematics of the internet : e-auction and markets , 2002 .
[8] N. Nisan,et al. The Communication Complexity of Efficient Allocation Problems , 2002 .
[9] Kazuo Murota,et al. Application of M-Convex submodular flow problem to mathematical economics , 2001, ISAAC.
[10] Makoto Yokoo,et al. Robust double auction protocol against false-name bids , 2001, Proceedings 21st International Conference on Distributed Computing Systems.
[11] Sven de Vries,et al. Linear Programming and Vickrey Auctions , 2001 .
[12] Y. Shoham,et al. Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .
[13] Noam Nisan,et al. Bidding and allocation in combinatorial auctions , 2000, EC '00.
[14] Daniel Lehmann,et al. Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics , 2000, EC '00.
[15] Moshe Tennenholtz. Some Tractable Combinatorial Auctions , 2000, AAAI/IAAI.
[16] Subhash Suri,et al. Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations , 2000, AAAI/IAAI.
[17] Makoto Yokoo,et al. Robust Combinatorial Auction Protocol against False-Name Bids , 2000, AAAI/IAAI.
[18] Ennio Stacchetti,et al. The English Auction with Differentiated Commodities , 2000, J. Econ. Theory.
[19] Makoto Yokoo,et al. The effect of false-name declarations in mechanism design: towards collective decision making on the Internet , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.
[20] Kazuo Murota,et al. Matrices and Matroids for Systems Analysis , 2000 .
[21] Paul R. Milgrom,et al. Putting Auction Theory to Work: The Simultaneous Ascending Auction , 1999, Journal of Political Economy.
[22] 櫻井 祐子,et al. Hal R. Varian: Economic Mechanism Design for Computerized Agents, the First Usenix Workshop on Electronic Commercr (1995). , 2000 .
[23] A. Tamura. New Characterizations of M-convex Functions and Connections to Mathematical Economics , 2000 .
[24] Tuomas Sandholm,et al. An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.
[25] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[26] Makoto Yokoo,et al. A Limitation of the Generalized Vickrey Auction in Electronic Commerce: Robustness against False-name Bids , 1999, AAAI/IAAI.
[27] Faruk Gul,et al. WALRASIAN EQUILIBRIUM WITH GROSS SUBSTITUTES , 1999 .
[28] Kazuo Murota,et al. M-Convex Function on Generalized Polymatroid , 1999, Math. Oper. Res..
[29] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[30] D. M. Topkis. Supermodularity and Complementarity , 1998 .
[31] H. Narayanan. Submodular functions and electrical networks , 1997 .
[32] Kazuo Murota,et al. Valuated Matroid Intersection II: Algorithms , 1996, SIAM J. Discret. Math..
[33] Hal R. Varian,et al. Economic Mechanism Design for Computerized Agents , 1995, USENIX Workshop on Electronic Commerce.
[34] Jeffrey K. MacKie-Mason,et al. Generalized Vickrey Auctions , 1994 .
[35] H. Moulin. Axioms of Cooperative Decision Making , 1988 .
[36] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[37] Gérard Cornuéjols,et al. Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem , 1984, Discret. Appl. Math..
[38] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[39] Martin Grötschel,et al. Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982 , 1983, ISMP.
[40] V. Crawford,et al. Job Matching, Coalition Formation, and Gross Substitutes , 1982 .
[41] Bernhard Korte,et al. Complexity of Matroid Property Algorithms , 1982, SIAM J. Comput..
[42] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.
[43] László Lovász,et al. Matroid matching and some applications , 1980, J. Comb. Theory, Ser. B.
[44] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[45] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[46] R. A. Cuninghame-Green,et al. Mathematical Programming Studies , 1977 .
[47] Theodore Groves,et al. Incentives in Teams , 1973 .
[48] E. H. Clarke. Multipart pricing of public goods , 1971 .
[49] Lloyd S. Shapley,et al. Complements and substitutes in the opttmal assignment problem , 1962 .
[50] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .