apl. Prof. Dr. Sascha Kurz
Mathematik · Universität Bayreuth
core methods team
|
|
|
Personal Information
Since 2005 Sascha Kurz is with the chair of Business Mathematics at the University of Bayreuth. Before that, he finished his PhD at the chair of Adalbert Kerber, where he obtained his diploma in mathematics in 2004. In 2008 he received his teaching qualification (Habilitation) in mathematics with the corresponding thesis titled "Discrete Structures, Algorithms, and Applications".
Competences
Sascha Kurz represents Discrete Mathematics in MODUS, in particular, Social Choice, Cooperative Game Theory, Coding Theory, Combinatorics and Discrete Optimization. Special attention is devoted to enumeration and exhaustive search techniques.
Projects
Sascha Kurz is member of the following MODUS projects:
- Optimal Diplomacy, with methods from Discrete Optimization under Uncertainty (application partner: Philosophy)
- Finished: Integrated Size and Price Optimization, with methods from Stochastic Integer Linear Programming (application partner: NKD Vertriebs GmbH, Bindlach)
Publications related to MODUS
2018
Beiträge auf Konferenzen
2015
-
2015 Optimal control of the freezing time in the Hegselmann--Krause dynamics Journal of Difference Equations and Applications 21 8 633-648 BibTeX
-
2015 Optimal Opinion Control : The Campaign Problem Journal of Artificial Societies and Social Simulation 18 3 1-47 BibTeX
-
2015 The Top-Dog Index : a new measurement for the demand consistency of the size distribution in pre-pack orders for a fashion discounter with many small branches Annals of Operations Research 229 1 541-563 BibTeX
Preprints
Artikel
Beiträge auf Konferenzen
2014
-
2014 On minimum integer representations of weighted games Mathematical Social Sciences 67 9 - 22 BibTeX
-
2014 Heuristic and exact solutions to the inverse power index problem for small voting bodies Annals of Operations Research 215 1 137-163 BibTeX
-
2014 Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum Annals of Operations Research 222 1 317-339 BibTeX
-
2014 How long does it take to consensus in the Hegselmann-Krause model? Proceedings in Applied Mathematics and Mechanics 14 1 803-804 BibTeX
-
2014 Evaluation of a new supply strategy based on stochastic programming for a fashion discounter Helber, Stefan (Hrsg.): Operations Research Proceedings 2012 Springer 515-520 BibTeX
Preprints
Artikel
Buchkapitel
Beiträge auf Konferenzen
2013
-
2013 The golden number and Fibonacci sequences in the design of voting structures European Journal of Operational Research 226 2 246-257 BibTeX
-
2013 On Dedekind’s problem for complete simple games International Journal of Game Theory 42 2 411-437 BibTeX
Artikel
2012
-
2012 The Integrated Size and Price Optimization problem Numerical Algebra, Control and Optimization 2 4 669-693 BibTeX
-
2012 On minimum sum representations for weighted voting games Annals of Operations Research 196 1 361-369 BibTeX
Preprints
Artikel
Beiträge auf Konferenzen
2011
-
2011 On the Hegselmann-Krause conjecture in opinion dynamics Journal of Difference Equations and Applications 17 6 859-876 BibTeX
Artikel
Beiträge auf Konferenzen
2010
Beiträge auf Konferenzen
2009
-
2009 The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts Models and Algorithms for Optimization in Logistics Schloss Dagstuhl — Leibniz-Zentrum für Informatik, Germany BibTeX