{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T23:12:02Z","timestamp":1719097922388},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T00:00:00Z","timestamp":1489104000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Informatik Spektrum"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00287-017-1023-8","type":"journal-article","created":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T12:57:22Z","timestamp":1489150642000},"page":"165-171","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithmic Economics und Operations Research"],"prefix":"10.1007","volume":"40","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,3,10]]},"reference":[{"issue":"6","key":"1023_CR1","doi-asserted-by":"crossref","first-page":"2273","DOI":"10.1137\/070701376","volume":"38","author":"S Albers","year":"2009","unstructured":"Albers S (2009) On the value of coordination in network design. SIAM J Comput 38(6):2273\u20132302","journal-title":"SIAM J Comput"},{"issue":"1","key":"1023_CR2","first-page":"2","volume":"2","author":"S Albers","year":"2014","unstructured":"Albers S, Eilts S, Even-Dar E, Mansour Y, Roditty L (2014) On Nash equilibria for a network creation game. ACM T Econ Comput 2(1):2","journal-title":"ACM T Econ Comput"},{"issue":"4","key":"1023_CR3","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1080\/15427951.2012.754800","volume":"9","author":"S Albers","year":"2013","unstructured":"Albers S, Lenzner P (2013) On approximate Nash equilibria in network design. Internet Math 9(4):384\u2013405","journal-title":"Internet Math"},{"key":"1023_CR4","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1080\/14786435.2015.1015469","volume":"95","author":"A Alpers","year":"2015","unstructured":"Alpers A, Brieden A, Gritzmann P, Lyckegaard A, Poulsen HF (2015) Generalized balanced power diagrams for 3D representations of polycrystals. Philos Mag 95:1016\u20131028","journal-title":"Philos Mag"},{"issue":"4","key":"1023_CR5","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich E, Dasgupta A, Kleinberg J, Tardos E, Wexler T, Roughgarden T (2008) The price of stability for network design with fair cost allocation. SIAM J Comput 38(4):1602\u20131623","journal-title":"SIAM J Comput"},{"issue":"1","key":"1023_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.4086\/toc.2008.v004a004","volume":"4","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich E, Dasgupta A, Tardos \u00c9, Wexler T (2008) Near-optimal network design with selfish agents. Theor Comput 4(1):77\u2013109","journal-title":"Theor Comput"},{"key":"1023_CR7","unstructured":"Aziz H, Brandt F, Elkind E, Skowron P (2017) Computational social choice: The first ten years and beyond. In: Steffen B, Woeginger G (eds) Computer Science Today, vol 10000, Lecture Notes in Computer Science (LNCS). Springer"},{"key":"1023_CR8","doi-asserted-by":"crossref","unstructured":"Bichler M, Goeree J (eds) (2017) Handbook of Spectrum Auction Design. Cambridge University Press","DOI":"10.1017\/9781316471609"},{"issue":"2","key":"1023_CR9","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 Theor 107(2):377\u2013406","journal-title":"J Econ Theor"},{"key":"1023_CR10","doi-asserted-by":"crossref","unstructured":"Bixby RE (2012) A brief history of linear and mixed-integer programming computation. Documenta Mathematica pp 107\u2013121","DOI":"10.4171\/dms\/6\/16"},{"key":"1023_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s00283-014-9448-2","volume":"36","author":"S Borgwardt","year":"2014","unstructured":"Borgwardt S, Brieden A, Gritzmann P (2014) Geometric clustering for the consolidation of farmland and woodland. Math Intell 36:37\u201344","journal-title":"Math Intell"},{"key":"1023_CR12","unstructured":"Brandl F, Brandt F, Geist C (2016) Proving the incompatibility of efficiency and strategyproofness via SMT solving. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI). AAAI Press, pp 116\u2013122"},{"issue":"5","key":"1023_CR13","doi-asserted-by":"crossref","first-page":"1839","DOI":"10.3982\/ECTA13337","volume":"84","author":"F Brandl","year":"2016","unstructured":"Brandl F, Brandt F, Seedig HG (2016) Consistent probabilistic social choice. Econometrica 84(5):1839\u20131880","journal-title":"Econometrica"},{"key":"1023_CR14","doi-asserted-by":"crossref","unstructured":"Brandt F, Conitzer V, Endriss U, Lang J, Procaccia A (eds) (2016) Handbook of Computational Social Choice. Cambridge University Press","DOI":"10.1017\/CBO9781107446984.002"},{"key":"1023_CR15","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.4959","volume":"55","author":"F Brandt","year":"2016","unstructured":"Brandt F, Geist C (2016) Finding strategyproof social choice functions via SAT solving. J Artif Intell Res 55:565\u2013602","journal-title":"J Artif Intell Res"},{"key":"1023_CR16","unstructured":"Brieden A, Gritzmann P, Klemm F (2017) Electoral district design via constrained clustering. Eur J Oper Res (in revision)"},{"key":"1023_CR17","unstructured":"Carlsson JG, Carlsson E, Devulapalli R (2014) Balancing workloads of service vehicles over a geographic territory. In: IEEE\/RSJ Intern. Conf. Intelligent Robots and Systems, pp 209\u2013216"},{"key":"1023_CR18","unstructured":"Conway RW, Maxwell WL, Miller LW (1967) Theory of Scheduling. Addison-Wesley"},{"key":"1023_CR19","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/TAC.2010.2040495","volume":"55","author":"J Cortes","year":"2010","unstructured":"Cortes J (2010) Coverage optimization and spatial load balancing by robotic sensor networks. IEEE T Autom Control 55:749\u2013754","journal-title":"IEEE T Autom Control"},{"issue":"1","key":"1023_CR20","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/j.ejor.2016.12.011","volume":"260","author":"F Diebold","year":"2017","unstructured":"Diebold F, Bichler M (2017) Matching with indifferences: a comparison of algorithms in the context of course allocation. Eur J Oper Res 260(1):268\u2013282","journal-title":"Eur J Oper Res"},{"key":"1023_CR21","doi-asserted-by":"crossref","unstructured":"Fabrikant A, Luthra A, Maneva E, Papadimitriou C, Shenker S (2003) On a network creation game. In: Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing (PODC). ACM Press, pp 347\u2013351","DOI":"10.1145\/872035.872088"},{"key":"1023_CR22","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.orl.2016.12.003","volume":"45","author":"S Fadaei","year":"2017","unstructured":"Fadaei S, Bichler M (2017) Generalized assignment problem: truthful mechanism design without money. Oper Res Lett 45:72\u201376","journal-title":"Oper Res Lett"},{"key":"1023_CR23","doi-asserted-by":"crossref","unstructured":"Frey M, Kolisch R, Artigues C (2017) Column generation for outbound baggage handling at airports. Transport Sci (accepted)","DOI":"10.1287\/trsc.2016.0702"},{"issue":"7","key":"1023_CR24","doi-asserted-by":"crossref","first-page":"1684","DOI":"10.1287\/mnsc.2014.2076","volume":"61","author":"A Goetzendorff","year":"2015","unstructured":"Goetzendorff A, Bichler M, Shabalin P, Day RW (2015) Compact bid languages and core pricing in large multi-item auctions. Manage Sci 61(7):1684\u20131703","journal-title":"Manage Sci"},{"key":"1023_CR25","unstructured":"Gritzmann P, Klee V (2017) Computational convexity. In: Handbook of Discrete and Computational Geometry, chapt 37, 3rd edn. Chapman & Hall\/CRC"},{"key":"1023_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan N, Roughgarden T, Tardos E, Vazirani V (2007) Algorithmic Game Theory. Cambridge University Press, Cambridge"},{"issue":"3","key":"1023_CR27","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/isre.1120.0452","volume":"24","author":"I Petrakis","year":"2012","unstructured":"Petrakis I, Ziegler G, Bichler M (2012) Ascending combinatorial auctions with allocation constraints: on game theoretical and computational properties of generic pricing rules. Inform Syst Res 24(3):768\u2013786","journal-title":"Inform Syst Res"}],"container-title":["Informatik-Spektrum"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-017-1023-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00287-017-1023-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-017-1023-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T22:40:38Z","timestamp":1719096038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00287-017-1023-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,10]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1023"],"URL":"https:\/\/doi.org\/10.1007\/s00287-017-1023-8","relation":{},"ISSN":["0170-6012","1432-122X"],"issn-type":[{"value":"0170-6012","type":"print"},{"value":"1432-122X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,10]]}}}