{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:26:16Z","timestamp":1725902776649},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662547113"},{"type":"electronic","value":"9783662547120"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54712-0_11","type":"book-chapter","created":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T15:08:51Z","timestamp":1498748931000},"page":"129-139","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic Economics und Operations Research"],"prefix":"10.1007","author":[{"given":"Susanne","family":"Albers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Bichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Brandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Gritzmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rainer","family":"Kolisch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,30]]},"reference":[{"issue":"6","key":"11_CR1","doi-asserted-by":"crossref","first-page":"2273","DOI":"10.1137\/070701376","volume":"38","author":"S Albers","year":"2009","unstructured":"S.\u00a0Albers. On the value of coordination in network design. SIAM Journal on Computing. 38(6):2273\u20132302, 2009.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"11_CR2","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1080\/15427951.2012.754800","volume":"9","author":"S Albers","year":"2013","unstructured":"S.\u00a0Albers and P.\u00a0Lenzner. On approximate Nash equilibria in network design. Internet Mathematics. 9(4):384\u2013405, 2013.","journal-title":"Internet Mathematics"},{"issue":"1","key":"11_CR3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/2560767","volume":"2","author":"S Albers","year":"2014","unstructured":"S.\u00a0Albers, S.\u00a0Eilts, E.\u00a0Even-Dar, Y.\u00a0Mansour, and L.\u00a0Roditty. On Nash equilibria for a network creation game. ACM Transactions on Economics and Computation. 2(1):2, 2014.","journal-title":"ACM Transactions on Economics and Computation"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1080\/14786435.2015.1015469","volume":"95","author":"A Alpers","year":"2015","unstructured":"A.\u00a0Alpers, A.\u00a0Brieden, P.\u00a0Gritzmann, A.\u00a0Lyckegaard, and H.\u00a0F. Poulsen. Generalized balanced power diagrams for 3D representations of polycrystals. Philosophical Magazine. 95:1016\u20131028, 2015.","journal-title":"Philosophical Magazine"},{"issue":"4","key":"11_CR5","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"E.\u00a0Anshelevich, A.\u00a0Dasgupta, J.\u00a0Kleinberg, E.\u00a0Tardos, T.\u00a0Wexler, and T.\u00a0Roughgarden. The price of stability for network design with fair cost allocation. SIAM Journal on Computing. 38(4):1602\u20131623, 2008.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"11_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.4086\/toc.2008.v004a004","volume":"4","author":"E Anshelevich","year":"2008","unstructured":"E.\u00a0Anshelevich, A.\u00a0Dasgupta, \u00c9.\u00a0Tardos, and T.\u00a0Wexler. Near-optimal network design with selfish agents. Theory of Computing. 4(1):77\u2013109, 2008.","journal-title":"Theory of Computing"},{"key":"11_CR7","volume-title":"Computer Science Today, volume 10000 of Lecture Notes in Computer Science (LNCS)","author":"H Aziz","year":"2017","unstructured":"H.\u00a0Aziz, F.\u00a0Brandt, E.\u00a0Elkind, and P.\u00a0Skowron. Computational social choice: The first ten years and beyond. In B.\u00a0Steffen and G.\u00a0Woeginger, editors, Computer Science Today, volume 10000 of Lecture Notes in Computer Science (LNCS). Springer-Verlag, 2017."},{"volume-title":"Handbook of spectrum auction design","year":"2017","key":"11_CR8","unstructured":"M.\u00a0Bichler and J.\u00a0Goeree, editors. Handbook of Spectrum Auction Design. Cambridge University Press, 2017."},{"issue":"2","key":"11_CR9","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1006\/jeth.2001.2957","volume":"107","author":"S Bikhchandani","year":"2002","unstructured":"S.\u00a0Bikhchandani and J.\u00a0M. Ostroy. The package assignment model. Journal of Economic theory. 107(2):377\u2013406, 2002.","journal-title":"Journal of Economic theory"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"R.\u00a0E. Bixby. A brief history of linear and mixed-integer programming computation. Documenta Mathematica. pages 107\u2013121, 2012.","DOI":"10.4171\/dms\/6\/16"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s00283-014-9448-2","volume":"36","author":"S Borgwardt","year":"2014","unstructured":"S.\u00a0Borgwardt, A.\u00a0Brieden, and P.\u00a0Gritzmann. Geometric clustering for the consolidation of farmland and woodland. Mathematical Intelligencer. 36:37\u201344, 2014.","journal-title":"Mathematical Intelligencer."},{"key":"11_CR12","first-page":"116","volume-title":"Proving the incompatibility of efficiency and strategyproofness via SMT solving","author":"F Brandl","year":"2016","unstructured":"F.\u00a0Brandl, F.\u00a0Brandt, and C.\u00a0Geist. Proving the incompatibility of efficiency and strategyproofness via SMT solving. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pages 116\u2013122. AAAI Press, 2016."},{"issue":"5","key":"11_CR13","doi-asserted-by":"crossref","first-page":"1839","DOI":"10.3982\/ECTA13337","volume":"84","author":"F Brandl","year":"1880","unstructured":"F.\u00a0Brandl, F.\u00a0Brandt, and H.\u00a0G. Seedig. Consistent probabilistic social choice. Econometrica. 84 (5): 1839\u20131880, 2016.","journal-title":"Econometrica"},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.4959","volume":"55","author":"F Brandt","year":"2016","unstructured":"F.\u00a0Brandt and C.\u00a0Geist. Finding strategyproof social choice functions via SAT solving. Journal of Artificial Intelligence Research. 55:565\u2013602, 2016.","journal-title":"Journal of Artificial Intelligence Research"},{"volume-title":"Handbook of computational social choice","year":"2016","key":"11_CR15","unstructured":"F.\u00a0Brandt, V.\u00a0Conitzer, U.\u00a0Endriss, J.\u00a0Lang, and A.\u00a0Procaccia, editors. Handbook of Computational Social Choice. Cambridge University Press, 2016."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"A.\u00a0Brieden, P.\u00a0Gritzmann, and F.\u00a0Klemm. Electoral district design via constrained clustering. European Journal of Operational Research (under revision). 2017.","DOI":"10.1016\/j.ejor.2017.04.018"},{"key":"11_CR17","first-page":"209","volume-title":"Balancing workloads of service vehicles over a geographic territory","author":"JG Carlsson","year":"2014","unstructured":"J.\u00a0G. Carlsson, E.\u00a0Carlsson, and R.\u00a0Devulapalli. Balancing workloads of service vehicles over a geographic territory. IEEE\/RSJ Intern. Conf. Intelligent Robots and Systems. pages 209\u2013216, 2014."},{"key":"11_CR18","volume-title":"Theory of scheduling","author":"R Conway","year":"1967","unstructured":"R.\u00a0Conway, W.\u00a0Maxwell, and L.\u00a0Miller. Theory of Scheduling. Addison\u2013Wesley, 1967."},{"key":"11_CR19","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/TAC.2010.2040495","volume":"55","author":"J Cortes","year":"2010","unstructured":"J.\u00a0Cortes. Coverage optimization and spatial load balancing by robotic sensor networks. IEEE Trans. Automatic Control. 55: 749\u2013754, 2010.","journal-title":"IEEE Trans. Automatic Control"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"F.\u00a0Diebold and M.\u00a0Bichler. Matching with ties: a comparison in the context of course allocation. European Journal on Operational Research. to appear, 2017.","DOI":"10.1016\/j.ejor.2016.12.011"},{"key":"11_CR21","first-page":"347","volume-title":"On a network creation game","author":"A Fabrikant","year":"2003","unstructured":"A.\u00a0Fabrikant, A.\u00a0Luthra, E.\u00a0Maneva, C.\u00a0Papadimitriou, and S.\u00a0Shenker. On a network creation game. In Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing (PODC). pages 347\u2013351. ACM Press, 2003."},{"key":"11_CR22","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.orl.2016.12.003","volume":"45","author":"S Fadaei","year":"2017","unstructured":"S.\u00a0Fadaei and M.\u00a0Bichler. Generalized assignment problem: Truthful mechanism design without money. Operations Research Letters. 45:72\u201376, 2017.","journal-title":"Operations Research Letters"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"M.\u00a0Frey, R.\u00a0Kolisch, and C.\u00a0Artigues. Column generation for outbound baggage handling at airports. Transportation Science. 2017.","DOI":"10.1287\/trsc.2017.0739"},{"issue":"7","key":"11_CR24","doi-asserted-by":"crossref","first-page":"1684","DOI":"10.1287\/mnsc.2014.2076","volume":"61","author":"A Goetzendorff","year":"2015","unstructured":"A.\u00a0Goetzendorff, M.\u00a0Bichler, P.\u00a0Shabalin, and R.\u00a0W. Day. Compact bid languages and core pricing in large multi-item auctions. Management Science. 61(7):1684\u20131703, 2015.","journal-title":"Management Science"},{"key":"11_CR25","volume-title":"Handbook of discrete and computational geometry. Chapter\u00a037","author":"P Gritzmann","year":"2017","unstructured":"P.\u00a0Gritzmann and V.\u00a0Klee. Computational convexity. In Handbook of Discrete and Computational Geometry. chapter\u00a037. 3rd edition, 2017.","edition":"3"},{"key":"11_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"N.\u00a0Nisan, T.\u00a0Roughgarden, E.\u00a0Tardos, and V.\u00a0Vazirani. Algorithmic game theory. Cambridge University Press Cambridge, 2007."},{"issue":"3","key":"11_CR27","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/isre.1120.0452","volume":"24","author":"I Petrakis","year":"2012","unstructured":"I.\u00a0Petrakis, G.\u00a0Ziegler, and M.\u00a0Bichler. Ascending combinatorial auctions with allocation constraints: On game theoretical and computational properties of generic pricing rules. Information Systems Research. 24(3):768\u2013786, 2012.","journal-title":"Information Systems Research"}],"container-title":["50 Jahre Universit\u00e4ts-Informatik in M\u00fcnchen"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54712-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T06:29:17Z","timestamp":1692858557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-54712-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662547113","9783662547120"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54712-0_11","relation":{},"subject":[],"published":{"date-parts":[[2017]]}}}