Zusammenfassung
Die Informatik hat viele Wissenschaften grundlegend beeinflusst, die Wirtschaftswissenschaften in besonders hohem Maße. Vor allem die enormen Fortschritte der Algorithmik und mathematischen Optimierung haben großen Einfluss auf Theorie und Praxis. Neben traditionellen Anwendungen des Operations Research in der Ablauf- oder Tourenplanung ermöglichen diese Fortschritte völlig neue Anwendungen, und sie spielen für Geschäftsmodelle der digitalen Wirtschaft eine wichtige Rolle. Die Schnittstelle zwischen Informatik, Mathematik und Wirtschaftswissenschaften hat sich im Münchner Umfeld von Universitäten und Industrie in den vergangenen Jahren sehr dynamisch entwickelt. Der vorliegende Artikel gibt verschiedene Beispiele, wie Algorithmen und neue Ansätze der Optimierung sowohl betriebswirtschaftliche Probleme lösen (erster Teil) als auch Entwicklungen der wirtschaftswissenschaftlichen Theorie beeinflussen (zweiter Teil). Sie zeugen von einer neuen, einer „informatischen“ Art, wirtschaftliche Prozesse zu gestalten und zu erklären, die auch international großen Auftrieb erhält.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
Träger des Graduiertenkolleg sind: Susanne Albers (IN), Dirk Bergemann (Yale University, IAS), Martin Bichler (IN, SoM), Peter Gritzmann (MA, IN), Martin Grunow (SOM), Rainer Kolisch (SOM), Stefan Minner (SOM, Sprecher des GK) und Andreas Schulz (MA, SOM).
Literatur
S. Albers. On the value of coordination in network design. SIAM Journal on Computing. 38(6):2273–2302, 2009.
S. Albers and P. Lenzner. On approximate Nash equilibria in network design. Internet Mathematics. 9(4):384–405, 2013.
S. Albers, S. Eilts, E. Even-Dar, Y. Mansour, and L. Roditty. On Nash equilibria for a network creation game. ACM Transactions on Economics and Computation. 2(1):2, 2014.
A. Alpers, A. Brieden, P. Gritzmann, A. Lyckegaard, and H. F. Poulsen. Generalized balanced power diagrams for 3D representations of polycrystals. Philosophical Magazine. 95:1016–1028, 2015.
E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. The price of stability for network design with fair cost allocation. SIAM Journal on Computing. 38(4):1602–1623, 2008.
E. Anshelevich, A. Dasgupta, É. Tardos, and T. Wexler. Near-optimal network design with selfish agents. Theory of Computing. 4(1):77–109, 2008.
H. Aziz, F. Brandt, E. Elkind, and P. Skowron. Computational social choice: The first ten years and beyond. In B. Steffen and G. Woeginger, editors, Computer Science Today, volume 10000 of Lecture Notes in Computer Science (LNCS). Springer-Verlag, 2017.
M. Bichler and J. Goeree, editors. Handbook of Spectrum Auction Design. Cambridge University Press, 2017.
S. Bikhchandani and J. M. Ostroy. The package assignment model. Journal of Economic theory. 107(2):377–406, 2002.
R. E. Bixby. A brief history of linear and mixed-integer programming computation. Documenta Mathematica. pages 107–121, 2012.
S. Borgwardt, A. Brieden, and P. Gritzmann. Geometric clustering for the consolidation of farmland and woodland. Mathematical Intelligencer. 36:37–44, 2014.
F. Brandl, F. Brandt, and C. Geist. Proving the incompatibility of efficiency and strategyproofness via SMT solving. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pages 116–122. AAAI Press, 2016.
F. Brandl, F. Brandt, and H. G. Seedig. Consistent probabilistic social choice. Econometrica. 84 (5): 1839–1880, 2016.
F. Brandt and C. Geist. Finding strategyproof social choice functions via SAT solving. Journal of Artificial Intelligence Research. 55:565–602, 2016.
F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. Procaccia, editors. Handbook of Computational Social Choice. Cambridge University Press, 2016.
A. Brieden, P. Gritzmann, and F. Klemm. Electoral district design via constrained clustering. European Journal of Operational Research (under revision). 2017.
J. G. Carlsson, E. Carlsson, and R. Devulapalli. Balancing workloads of service vehicles over a geographic territory. IEEE/RSJ Intern. Conf. Intelligent Robots and Systems. pages 209–216, 2014.
R. Conway, W. Maxwell, and L. Miller. Theory of Scheduling. Addison–Wesley, 1967.
J. Cortes. Coverage optimization and spatial load balancing by robotic sensor networks. IEEE Trans. Automatic Control. 55: 749–754, 2010.
F. Diebold and M. Bichler. Matching with ties: a comparison in the context of course allocation. European Journal on Operational Research. to appear, 2017.
A. Fabrikant, A. Luthra, E. Maneva, C. Papadimitriou, and S. Shenker. On a network creation game. In Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing (PODC). pages 347–351. ACM Press, 2003.
S. Fadaei and M. Bichler. Generalized assignment problem: Truthful mechanism design without money. Operations Research Letters. 45:72–76, 2017.
M. Frey, R. Kolisch, and C. Artigues. Column generation for outbound baggage handling at airports. Transportation Science. 2017.
A. Goetzendorff, M. Bichler, P. Shabalin, and R. W. Day. Compact bid languages and core pricing in large multi-item auctions. Management Science. 61(7):1684–1703, 2015.
P. Gritzmann and V. Klee. Computational convexity. In Handbook of Discrete and Computational Geometry. chapter 37. 3rd edition, 2017.
N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani. Algorithmic game theory. Cambridge University Press Cambridge, 2007.
I. Petrakis, G. Ziegler, and M. Bichler. Ascending combinatorial auctions with allocation constraints: On game theoretical and computational properties of generic pricing rules. Information Systems Research. 24(3):768–786, 2012.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer-Verlag GmbH Deutschland
About this chapter
Cite this chapter
Albers, S., Bichler, M., Brandt, F., Gritzmann, P., Kolisch, R. (2017). Algorithmic Economics und Operations Research. In: Bode, A., Broy, M., Bungartz, HJ., Matthes, F. (eds) 50 Jahre Universitäts-Informatik in München. Springer Vieweg, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-54712-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-54712-0_11
Published:
Publisher Name: Springer Vieweg, Berlin, Heidelberg
Print ISBN: 978-3-662-54711-3
Online ISBN: 978-3-662-54712-0
eBook Packages: Computer Science and Engineering (German Language)