{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T11:42:08Z","timestamp":1745235728196},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T00:00:00Z","timestamp":1454630400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00291-016-0430-6","type":"journal-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T12:52:33Z","timestamp":1454676753000},"page":"1043-1070","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Pricing combinatorial auctions by a set of linear price vectors"],"prefix":"10.1007","volume":"38","author":[{"given":"Dirk","family":"Briskorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"J\u00f8rnsten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jenny","family":"Nossack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,5]]},"reference":[{"key":"430_CR1","doi-asserted-by":"crossref","first-page":"206","DOI":"10.2307\/1909864","volume":"34","author":"RE Alcaly","year":"1966","unstructured":"Alcaly RE, Klevorick AK (1966) A note on dual prices of integer programs. Econometrica 34:206\u2013214","journal-title":"Econometrica"},{"key":"430_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/isre.1070.0151","volume":"20","author":"M Bichler","year":"2009","unstructured":"Bichler M, Shabalin P, Pikovsky A (2009) A computational analysis of linear price iterative combinatorial auction formats. Inf Syst Res 20:33\u201359","journal-title":"Inf Syst Res"},{"key":"430_CR3","doi-asserted-by":"crossref","unstructured":"Bichler M, Shabalin P, Ziegler G (2010) Efficiency with linear prices: a theoretical and experimental analysis of the combinatorial clock auction. In: Proceedings of the 11th ACM conference on electronic commerce, EC \u201910. ACM, pp 285\u2013286","DOI":"10.1145\/1807342.1807388"},{"key":"430_CR4","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1287\/isre.1120.0426","volume":"24","author":"M Bichler","year":"2013","unstructured":"Bichler M, Shabalin P, Ziegler G (2013) Efficiency with linear prices? A game-theoretical and computational analysis of the combinatorial clock auction. Inf Syst Res 24:394\u2013417","journal-title":"Inf Syst Res"},{"key":"430_CR5","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1006\/jeth.2001.2957","volume":"107","author":"S Bikhchandani","year":"2002","unstructured":"Bikhchandani S, Ostroy JM (2002) The package assignment model. J Econ Theory 107:377\u2013406","journal-title":"J Econ Theory"},{"key":"430_CR6","unstructured":"Bikhchandani S, Ostroy JM (2006) From the assignment model to combinatorial auctions. In: Cramton et al. (2006), pp 189\u2013214"},{"key":"430_CR7","doi-asserted-by":"crossref","unstructured":"Blumrosen L, Nisan N (2007) Combinatorial auctions. In: Nisan N, Roughgarden T, Tardos E, Vazirani V (ed) Algorithmic game theory, Cambridge University Press","DOI":"10.1017\/CBO9780511800481.013"},{"key":"430_CR8","doi-asserted-by":"crossref","unstructured":"Briskorn D, J\u00f8rnsten K, Zeise P. A pricing scheme for combinatorial auctions based on bundle sizes. Comput Oper Res 70:9\u201317","DOI":"10.1016\/j.cor.2015.12.008"},{"key":"430_CR9","unstructured":"Cantillon E, Pesendorfer M (2006) Auctioning bus routes: the London experience. In: Cramton et al. (2006), pp 573\u2013592"},{"key":"430_CR10","doi-asserted-by":"crossref","unstructured":"Cramton P, Shoham Y, Steinberg R (eds) (2006) Combinatorial auctions. MIT Press, Cambridge","DOI":"10.7551\/mitpress\/9780262033428.001.0001"},{"issue":"3","key":"430_CR11","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S Vries de","year":"2003","unstructured":"de Vries S, Vohra RV (2003) Combinatorial auctions: a survey. INFORMS J Comput 15(3):284\u2013309","journal-title":"INFORMS J Comput"},{"key":"430_CR12","doi-asserted-by":"crossref","first-page":"1652","DOI":"10.1057\/palgrave.jors.2602299","volume":"58","author":"A Drexl","year":"2007","unstructured":"Drexl A, J\u00f8rnsten K (2007) Reflections about pseudo-dual prices in combinatorial auctions. J Oper Res Soc 58:1652\u20131659","journal-title":"J Oper Res Soc"},{"key":"430_CR13","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.ejor.2008.11.029","volume":"199","author":"A Drexl","year":"2009","unstructured":"Drexl A, J\u00f8rnsten K, Knof D (2009) Non-linear anonymous pricing combinatorial auctions. Eur J Oper Res 199:296\u2013302","journal-title":"Eur J Oper Res"},{"key":"430_CR14","unstructured":"Dunford M, Hoffman K, Menon D, Sultana R, Wilson T (2007) Testing linear pricing algorithms for use in ascending combinatorial auctions. Technical report, George MasonUniversity"},{"key":"430_CR15","volume-title":"Computers and intractability\u2014a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability\u2014a guide to the theory of NP-completeness. W.H. Freeman and Company, San Francisco"},{"key":"430_CR16","doi-asserted-by":"crossref","first-page":"521","DOI":"10.2307\/1910130","volume":"28","author":"RE Gomory","year":"1960","unstructured":"Gomory RE, Baumol WJ (1960) Integer programming and pricing. Econometrica 28:521\u2013550","journal-title":"Econometrica"},{"key":"430_CR17","doi-asserted-by":"crossref","unstructured":"Hoffman K (2006) Choosing a combinatorial auction design: an illustrated example. In: Alt FB, Fu MC, Golden BL, Sharda R, Vo\u00df S (eds) Perspectives in operations research, vol 36., Operations research\/computer science interfaces series. Springer, New York, pp 153\u2013177","DOI":"10.1007\/978-0-387-39934-8_9"},{"key":"430_CR18","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/mnsc.1040.0334","volume":"51","author":"AM Kwasnica","year":"2005","unstructured":"Kwasnica AM, Ledyard JO, Porter D, DeMartini C (2005) A new and improved design for multiobject iterative auctions. Manage Sci 51:419\u2013434","journal-title":"Manage Sci"},{"key":"430_CR19","doi-asserted-by":"crossref","unstructured":"Ledyard JO (2007) Optimal combinatoric auctions with single-minded bidders. In: Proceedings of the 8th ACM conference on electronic commerce, EC \u201907, New York, NY, USA. ACM, pp 237\u2013242","DOI":"10.1145\/1250910.1250945"},{"key":"430_CR20","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/inte.32.5.4.30","volume":"32","author":"JO Ledyard","year":"2002","unstructured":"Ledyard JO, Olson M, Porter D, Swanson JA, Torma DP (2002) The first use of a combined-value auction for transportation services. Interfaces 32:4\u201312","journal-title":"Interfaces"},{"key":"430_CR21","unstructured":"Lehmann D, M\u00fcller R, Sandholm T (2006) The winner determination problem. In: Cramton et al. (2006), pp 297\u2013318"},{"key":"430_CR22","unstructured":"Leyton-Brown K (2011) Cats website. http:\/\/www.cs.ubc.ca\/kevinlb\/CATS\/"},{"key":"430_CR23","unstructured":"Leyton-Brown K, Shoham Y (2006) A test suite for combinatorial auctions. In: Cramton et al. (2006), pp 451\u2013478"},{"issue":"1","key":"430_CR24","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/10556788.2013.823544","volume":"29","author":"A Martin","year":"2014","unstructured":"Martin A, M\u00fcller JC, Pokutta S (2014) Strict linear prices in non-convex european day-ahead electricity markets. Optim Methods Softw 29(1):189\u2013221","journal-title":"Optim Methods Softw"},{"key":"430_CR25","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1016\/j.ejor.2008.04.031","volume":"196","author":"L Meeus","year":"2009","unstructured":"Meeus L, Verhaegen K, Belmans R (2009) Block order restrictions in combinatorial electric energy auctions. Eur J Oper Res 196:1202\u20131206","journal-title":"Eur J Oper Res"},{"key":"430_CR26","unstructured":"M\u00fcller R (2006) Tractable cases of the winner determination problem. In: Cramton et al. (2006), pp 319\u2013336"},{"key":"430_CR27","doi-asserted-by":"crossref","unstructured":"Nisan N, Roughgarden T, Tardos E, Vazirani VV (eds) (2007) Algorithmic game theory. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511800481"},{"key":"430_CR28","doi-asserted-by":"crossref","first-page":"402","DOI":"10.2307\/3003463","volume":"13","author":"SJ Rassenti","year":"1982","unstructured":"Rassenti SJ, Smith VL, Bulfin RL (1982) A combinatorial auction mechanism for airport time slot allocation. Bell J Econ 13:402\u2013417","journal-title":"Bell J Econ"},{"key":"430_CR29","unstructured":"Sandholm T (2006) Optimal winner determination algorithms. In: Cramton et al. (2006), pp 337\u2013368"},{"key":"430_CR30","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/isre.1090.0267","volume":"22","author":"T Scheffel","year":"2011","unstructured":"Scheffel T, Pikovsky A, Bichler M, Guler K (2011) An experimental comparison of linear and nonlinear price combinatorial auctions. Inf Syst Res 22:346\u2013368","journal-title":"Inf Syst Res"},{"key":"430_CR31","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01589344","volume":"20","author":"LA Wolsey","year":"1981","unstructured":"Wolsey LA (1981) Integer programming duality: price functions and sensitivity analysis. Math Program 20:173\u2013195","journal-title":"Math Program"},{"key":"430_CR32","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0377-2217(02)00678-1","volume":"154","author":"M Xia","year":"2004","unstructured":"Xia M, Koehler GJ, Whinston AB (2004) Pricing combinatorial auctions. Eur J Oper Res 154:251\u2013270","journal-title":"Eur J Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0430-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-016-0430-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0430-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0430-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T09:01:04Z","timestamp":1567587664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-016-0430-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,5]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["430"],"URL":"https:\/\/doi.org\/10.1007\/s00291-016-0430-6","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,5]]}}}