{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:30:35Z","timestamp":1725521435589},"publisher-location":"Boston, MA","reference-count":43,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387306629"},{"type":"electronic","value":"9780387301655"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/978-0-387-30165-5_36","type":"book-chapter","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T07:26:59Z","timestamp":1228807619000},"page":"1051-1071","source":"Crossref","is-referenced-by-count":0,"title":["Optimization Issues in Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"Stan","family":"van Hoesel","sequence":"first","affiliation":[]},{"given":"Rudolf","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"36_CR1","first-page":"1","volume":"2","author":"J. Abrache","year":"2004","unstructured":"J. Abrache, T.G. Crainic, and M. Gendreau. Design issues for combinatorial auctions. 40R, 2(1):1\u201333, 2004.","journal-title":"40R"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"L. M. Ausubel and P. Milgrom. The lovely but lonely Vickrey auction. In P. Cramton, Y. Shoham, and R. Steinberg, editors, Combinatorial Auctions. MIT Press, 2005.","DOI":"10.7551\/mitpress\/9780262033428.003.0002"},{"issue":"5","key":"36_CR3","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1257\/0002828043052330","volume":"94","author":"L.M. Ausubel","year":"2004","unstructured":"L.M. Ausubel. An efficient ascending-bid auction for multiple objects. American Economic Review, 94(5): 1452\u20131475, 2004.","journal-title":"American Economic Review"},{"key":"36_CR4","first-page":"377","volume":"2002","author":"S. Bikhchandani","year":"2003","unstructured":"S. Bikhchandani and J. Ostroy. The package assignment model. Journal of Economic Theory, 2002:377\u2013406, 2003.","journal-title":"Journal of Economic Theory"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0165-4896(00)00071-8","volume":"41","author":"V. Danilov","year":"2001","unstructured":"V. Danilov, G. Koshevoy, and K. Murota. Discrete convexity and equilibria in economies with indivisible goods and money. Mathematical Social Sciences, 41: 251\u2013273, 2001.","journal-title":"Mathematical Social Sciences"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"185","DOI":"10.2307\/2297045","volume":"46","author":"H. P. Dasgupta","year":"1979","unstructured":"H. P. Dasgupta and E. Maskin. The implementation of social choice rules: some results on incentive compatibility. Review of Economic Studies, 46:185\u2013216, 1979.","journal-title":"Review of Economic Studies"},{"key":"36_CR7","unstructured":"S. de Vries, J. Schummer, and R. V. Vohra. On ascending auctions for heterogeneous objects, 2003."},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S. Vries de","year":"2003","unstructured":"S. de Vries and R.R. Vohra. Combinatorial auctions: A survey. INFORMS Journal on Computing, 15:284\u2013309, 2003.","journal-title":"INFORMS Journal on Computing"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1086\/261411","volume":"94","author":"G. Demange","year":"1986","unstructured":"G. Demange, D. Gale, and M. Sotomayor. Multi-item auctions. Journal of Political Economy, 94:863\u2013872, 1986.","journal-title":"Journal of Political Economy"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1287\/moor.28.3.463.16393","volume":"28","author":"S. Fujishige","year":"2003","unstructured":"S. Fujishige and Z. Yang. A note on kelso and Crawford\u2019s gross substitutes condition. Mathematics of Operations Research, 28:463\u2013469, 2003.","journal-title":"Mathematics of Operations Research"},{"key":"36_CR11","volume-title":"\u201cComputers and Intractability,\u201d","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. \u201cComputers and Intractability,\u201d. Freeman, San Francisco, 1979."},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"F. Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. Journal Combinatorial Theory B, 16:47\u201356, 1974.","journal-title":"Journal Combinatorial Theory B"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1006\/jeth.1999.2531","volume":"87","author":"F. Gul","year":"1999","unstructured":"F. Gul and E. Stacchetti. Walrasian equilibrium with gross substitutes. Journal of Economic Theory, 87:95\u2013124, 1999.","journal-title":"Journal of Economic Theory"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jeth.1999.2580","volume":"92","author":"F. Gul","year":"2000","unstructured":"F. Gul and E. Stacchetti. The english auction with differentiated commodities. Journal of Economic Theory, 92:66\u201395, 2000.","journal-title":"Journal of Economic Theory"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"O. G\u00fcnl\u00fck, L. Lad\u00e4nyi, and S. De Vries. A branch-and-price algorithm and new test problems for spectrum auctions. Management Science, (to appear), 2004.","DOI":"10.1287\/mnsc.1040.0332"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"John Hershberger and Subhash Suri. Vickrey prices and shortest paths: What is an edge worth? In Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, pages 255\u2013262. IEEE Computer Society, 2001.","DOI":"10.1109\/SFCS.2001.959899"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1009940607600","volume":"3","author":"S. Hoesel van","year":"2001","unstructured":"Stan van Hoesel and Rudolf M\u00fcller. Optimization in electronic markets: Examples in combinatorial auctions. Netnomics, 3:23\u201333, 2001.","journal-title":"Netnomics"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"R. C. Holte. Combinatorial auctions, knapsack problems, and hill-climbing search. In E. Stroulia and S. Matwin, editors, Proc. AI\u20192001, the 14th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, volume 2056 of Springer Lecture Notes in Artificial Intelligence, pages 57\u201366, 2001.","DOI":"10.1007\/3-540-45153-6_6"},{"key":"36_CR19","volume-title":"Technology for spectrum markets","author":"C. Jackson","year":"1976","unstructured":"C. Jackson. Technology for spectrum markets. PhD thesis, Department of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, MA, 1976."},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"H. Kellerer, U. Pferchy, and D. Pirsinger. Knapsack Problems. Springer Verlag, 2004.","DOI":"10.1007\/978-3-540-24777-7"},{"issue":"6","key":"36_CR21","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.2307\/1913392","volume":"50","author":"A. S. Kelso","year":"1982","unstructured":"A. S. Kelso and V. P. Crawford. Job matching, coalition formation and gross substitutes. Econometrica, 50(6): 1483\u20131504, 1982.","journal-title":"Econometrica"},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"D. Lehmann, R. M\u00fcller, and T. Sandholm. The winner determination problem. In P. Cramton, Y. Shoham, and R. Steinberg, editors, Combinatorial Auctions. MIT Press, 2005.","DOI":"10.7551\/mitpress\/9780262033428.003.0013"},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"K. Leyton-Brown and Y. Shoham. A test-suite for combinatorial auctions. In P. Cramton, Y. Shoham, and R. Steinberg, editors, Combinatorial Auctions. MIT Press, 2005.","DOI":"10.7551\/mitpress\/9780262033428.003.0019"},{"key":"36_CR24","unstructured":"P. Maill\u00e9 and B. Tuffin. Multi-bid auctions for bandwidth allocation in communication networks. In Proc. of IEEE INFOCOM 2004, Hong Kong, 2004."},{"key":"36_CR25","unstructured":"A. Mas-Colell, M. D. Whinsont, and J. R. Green. Microeconomic Theory. Oxford University Press, 1995."},{"key":"36_CR26","doi-asserted-by":"crossref","unstructured":"R. M\u00fcller. Tractable cases of the winner determination problem. In P. Cramton, Y. Shoham, and R. Steinberg, editors, Combinatorial Auctions. MIT Press, 2005.","DOI":"10.7551\/mitpress\/9780262033428.001.0001"},{"key":"36_CR27","doi-asserted-by":"crossref","unstructured":"K. Murota and A. Tamura. Application of m-convex submodular flow problem to mathematical economics. In P. Eades and T Takaoka, editors, Algorithms and Computation, Proc. of 12th International Symposium, ISAAC 2001, volume 2223 of Springer Lecture Notes in Computer Science, pages 14\u201325, Christchurch, New Zealand, 2001.","DOI":"10.1007\/3-540-45678-3_2"},{"key":"36_CR28","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/S0166-218X(02)00469-9","volume":"131","author":"K. Murota","year":"2003","unstructured":"K. Murota and A. Tamura. New characterizations of m-convex functions and their applications to economic equilibrium models. Discrete Applied Mathematics, 131:495\u2013512, 2003.","journal-title":"Discrete Applied Mathematics"},{"key":"36_CR29","doi-asserted-by":"publisher","first-page":"61","DOI":"10.2307\/1912346","volume":"47","author":"R. Myerson","year":"1979","unstructured":"R. Myerson. Incentive compatibility and the bargaining problem. Econometrica, 47: 61\u201374, 1979.","journal-title":"Econometrica"},{"key":"36_CR30","doi-asserted-by":"crossref","unstructured":"N. Nisan. Bidding and allocation in combinatorial auctions. Proceedings of the ACM Conference on Electronic Commerce (EC-00), available at http:\/\/www.cs.huji.ac.il\/~noam\/mkts.html , 2000.","DOI":"10.1145\/352871.352872"},{"key":"36_CR31","doi-asserted-by":"crossref","unstructured":"N. Nisan. Bidding languages for combinatorial auctions. In P. Cramton, Y. Shoham, and R. Steinberg, editors, Combinatorial Auctions. MIT Press, 2005.","DOI":"10.7551\/mitpress\/9780262033428.003.0010"},{"key":"36_CR32","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0020-0190(00)00073-9","volume":"75","author":"M. Penn","year":"2000","unstructured":"M. Penn and M. Tennenholtz. Constrained multi-object auctions and b-matchings. Information Processing Letters, 75:29\u201334, 2000.","journal-title":"Information Processing Letters"},{"key":"36_CR33","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s00199-001-0248-5","volume":"20","author":"H. Reijnierse","year":"2002","unstructured":"H. Reijnierse, A. van Gellekom, and J.A.M. Potters. Verifying gross substitutability. Economic Theory, 20:767\u2013776, 2002.","journal-title":"Economic Theory"},{"key":"36_CR34","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M. H. Rothkopf","year":"1998","unstructured":"M. H. Rothkopf, A. Peke\u010d, and R.M. Harstad. Computationally manageable combinational auctions. Management Science, 44:1131\u20131147, 1998.","journal-title":"Management Science"},{"key":"36_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T. Sandholm","year":"2002","unstructured":"T. Sandholm. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135:1\u201354, 2002.","journal-title":"Artificial Intelligence"},{"issue":"12","key":"36_CR36","doi-asserted-by":"publisher","first-page":"2499","DOI":"10.1109\/49.898733","volume":"18","author":"N. Semret","year":"2000","unstructured":"N. Semret, R.R.-F. Liao, A.T. Campbell, and A.A. Lazar. Pricing, provisioning and peering: Dynamic markets for differentiated internet services and implications for network interconnections. IEEE Journal on Selected Areas in Communication, 18(12):2499\u20132513, 2000.","journal-title":"IEEE Journal on Selected Areas in Communication"},{"key":"36_CR37","doi-asserted-by":"crossref","unstructured":"S. Shenker, D. Clark, D. Estrin, and S. Herzog. Pricing in computer networks: Reshaping the research agenda. Telecommunications policy, pages 183\u2013201, 1996.","DOI":"10.1016\/0308-5961(96)00002-X"},{"key":"36_CR38","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(97)00140-6","volume":"84","author":"A. Shioura","year":"1998","unstructured":"A. Shioura. Minimization of an m-convex function. Discrete Applied Mathematics, 84:215\u2013220, 1998.","journal-title":"Discrete Applied Mathematics"},{"key":"36_CR39","unstructured":"M. Spicer. International survey of spectrum assignment for cellular and PCS. Federal Communications Commission. http:\/\/wireless.fcc.gov\/auctions\/data\/papersAndStudies.html , 1996."},{"issue":"5","key":"36_CR40","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","volume":"2","author":"F. C. R. Spieksma","year":"1999","unstructured":"F. C. R. Spieksma. On the approximability of an interval scheduling problem. Journal of Scheduling, 2(5):215\u2013227, (1999.","journal-title":"Journal of Scheduling"},{"key":"36_CR41","unstructured":"N. Sun and Z. Yang. The max-convolution approach to equilibrium models with indivisibilities, 2004."},{"key":"36_CR42","unstructured":"M. Tennenholtz. Some tractable combinatorial auctions. In Proc. of National Conference on Artificial Intelligence (AAAI), pages 98\u2013103, 2000."},{"key":"36_CR43","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W. S. Vickrey","year":"1961","unstructured":"W. S. Vickrey. Counterspeculation, auctions and competitive sealed tenders. Journal of Finance, 16:8\u201337, 1961.","journal-title":"Journal of Finance"}],"container-title":["Handbook of Optimization in Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30165-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T22:53:00Z","timestamp":1557960780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-30165-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9780387306629","9780387301655"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30165-5_36","relation":{},"subject":[],"published":{"date-parts":[[2006]]}}}