Druckansicht der Internetadresse:

Fakultät für Mathematik, Physik und Informatik

Lehrstuhl für Wirtschaftsmathematik - Prof. Dr. Jörg Rambau

Seite drucken

Team > apl. Prof. Dr. Sascha Kurz

zurück zur Übersicht
zurück zur Übersicht
apl. Prof. Dr. Sascha Kurz apl. Prof. Dr. Sascha Kurz
apl. Prof. Dr. Sascha Kurz

Fakultät für Mathematik, Physik und Informatik
Mathematisches Institut


Discrete Structures
Voting Systems
Divisible Codes
Subspace Codes
apl. Prof. Dr. Sascha Kurz

Fakultät für Mathematik, Physik und Informatik
Mathematisches Institut


Publikationen

2021

Artikel

Iliya Bouyukliev, Stefka Bouyuklieva, Sascha Kurz: Computer classification of linear codes. In: IEEE Transactions on Information Theory, 67 (2021). - S. 7807-7814.
doi:10.1109/TIT.2021.3114280

Sascha Kurz: Bounds for flag codes. In: Designs, Codes and Cryptography, 89 (2021). - S. 2759-2785.
doi:10.1007/s10623-021-00953-w

Miriam Kießling, Sascha Kurz, Jörg Rambau: An exact column-generation approach for the lot-type design problem. In: TOP : An Official Journal of the Spanish Society of Statistics and Operations Research, 29 (2021). - S. 741-780.
doi:10.1007/s11750-020-00582-x

Romar dela Cruz, Sascha Kurz: On the maximum number of minimal codewords. In: Discrete Mathematics, 344 (2021). - .
doi:10.1016/j.disc.2021.112510

Sascha Kurz: The [46,9,20]₂ code is unique. In: Advances in Mathematics of Communications, 15 (2021). - S. 415-422.
doi:10.3934/amc.2020074

Sascha Kurz, Issofa Moyouwou, Hilaire Touyem: Axiomatizations for the Shapley-Shubik power index for games with several levels of approval in the input and output. In: Social Choice and Welfare, 56 (2021). - S. 569-594.
doi:10.1007/s00355-020-01296-6

Sascha Kurz: A note on the growth of the dimension in complete simple games. In: Mathematical Social Sciences, 110 (2021). - S. 14-18.
doi:10.1016/j.mathsocsci.2021.01.001

Sascha Kurz, Alexander Mayer, Stefan Napel: Influence in weighted committees. In: European Economic Review, 132 (2021). - .
doi:10.1016/j.euroecorev.2020.103634

Sascha Kurz: No Projective 16-Divisible Binary Linear Code of Length 131 Exists. In: IEEE Communications Letters, 25 (2021). - S. 38-40.
doi:10.1109/LCOMM.2020.3021939

Sascha Kurz, Eitan Yaakobi: PIR Codes with Short Block Length. In: Designs, Codes and Cryptography, 89 (2021). - S. 559-587.
doi:10.1007/s10623-020-00828-6

Preprints

Michael Geißer, Theresa Körner, Sascha Kurz, Anne Zahn: Squares with three digits.. - Bayreuth, 2021-12-01. - 42 S.
doi:10.15495/EPub_UBT_00005912

Sascha Kurz, Dani Samaniego: A note on simple games with two equivalence classes of players.. - Bayreuth, 2021-12-01. - 13 S.
doi:10.15495/EPub_UBT_00005911

Sascha Kurz, Ivan Landjev, Assia Rousseva: Classification of (3 mod 5) arcs in PG(3,5).. - Bayreuth, 2021-08-10. - 33 S.
doi:10.15495/EPub_UBT_00005712

Sascha Kurz: The interplay of different metrics for the construction of constant dimension codes.. - Bayreuth, 2021-07-29. - 18 S.
doi:10.15495/EPub_UBT_00005780

Sascha Kurz: The Public Good index for games with several levels of approval in the input and output.. - Bayreuth, 2021-07-22. - 16 S.
doi:10.15495/EPub_UBT_00005702

Tao Feng, Sascha Kurz, Shuangqing Liu: Bounds for the multilevel construction.. - Bayreuth, 2021-06-30. - 95 S.
doi:10.15495/EPub_UBT_00005691

Sascha Kurz: Bounds for flag codes.. - Bayreuth, 2021-05-01. - 23 S.
doi:10.15495/EPub_UBT_00005430

Antonio Cossidente, Sascha Kurz, Giuseppe Marino, Francesco Pavese: Combining subspace codes.. - Bayreuth, 2021-05-05. - 17 S.
doi:10.15495/EPub_UBT_00005905

Sascha Kurz: Are weighted games sufficiently good for binary voting?.. - Bayreuth, 2021-05-18. - 7 S.
doi:10.15495/EPub_UBT_00005539

Michael Kiermaier, Sascha Kurz: Classification of Δ-divisible linear codes spanned by codewords of weight Δ.. - Bayreuth, 2021-01. - 12 S.
doi:10.15495/EPub_UBT_00005227

Vorträge

Sascha Kurz, Alexander Mayer, Stefan Napel: Influence in Weighted Committees. - (Vortrag), Veranstaltung: GAMES 2020, the 6th World Congres of the Game Theory Society, 19.-23.07.2021, Budapest, Ungarn.

Sascha Kurz, Alexander Mayer: Values under uncertainty. - (Vortrag), Veranstaltung: GAMES 2020, the 6th World Congres of the Game Theory Society, 19.-23.07.2021, Budapest.

Fatemeh Kazemi, Sascha Kurz, Emina Soljanin, Alex Sprintson: Efficient Storage Schemes for Desired Service Rate Regions. - (Vortrag), Veranstaltung: IEEE Information Theory Workshop 2020, 11.-15.04.2021, virtuell.

Sascha Kurz, Alexander Mayer, Stefan Napel: Power and Social Choice in Weighted Commitees. - (Vortrag), Veranstaltung: Adam Smith Seminar - Center of Conflict Resolution, 19.04.2021, München.

2020

Artikel

Sascha Kurz: Which criteria qualify power indices for applications? : A comment on "The story of the poor Public Good index". In: Munich Social Science Review, 3 (2020). - S. 185-198.

Sascha Kurz: Generalized LMRD code bounds for constant dimension codes. In: IEEE Communications Letters, 24 (2020). - S. 2100-2103.
doi:10.1109/LCOMM.2020.3003132

Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak: Subspace packings : constructions and bounds. In: Designs, Codes and Cryptography, 88 (2020). - S. 1781-1810.
doi:10.1007/s10623-020-00732-z

Michael Kiermaier, Sascha Kurz: On the lengths of divisible codes. In: IEEE Transactions on Information Theory, 66 (2020). - S. 4051-4060.
doi:10.1109/TIT.2020.2968832

Sascha Kurz, Alexander Mayer, Stefan Napel: Weighted Committee Games. In: European Journal of Operational Research, 282 (2020). - S. 972-979.
doi:10.1016/j.ejor.2019.10.023

Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: The Lengths of Projective Triply-Even Binary Codes. In: IEEE Transactions on Information Theory, 66 (2020). - S. 2713-2716.
doi:10.1109/TIT.2019.2940967

Sascha Kurz: Subspaces intersecting in at most a point. In: Designs, Codes and Cryptography, 88 (2020). - S. 595-599.
doi:10.1007/s10623-019-00699-6

Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma: Simple games versus weighted voting games : Bounding the critical threshold value. In: Social Choice and Welfare, 54 (2020). - S. 609-621.
doi:10.1007/s00355-019-01221-6

Sascha Kurz: A note on limit results for the Penrose-Banzhaf index. In: Theory and Decision, 88 (2020). - S. 191-203.
doi:10.1007/s11238-019-09726-3

Buchkapitel

Fatemeh Kazemi, Sascha Kurz, Emina Soljanin: A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes. In: 2020 IEEE International Symposium on Information Theory : Proceedings. - Piscataway, NJ : IEEE, 2020. - S. 66-71.
doi:10.1109/ISIT44484.2020.9174345

Preprints

Michael Kiermaier, Sascha Kurz, Patrick Solé, Michael Stoll, Alfred Wassermann: On strongly walk regular graphs,triple sum sets and their codes.. - Bayreuth, 2020-12. - 33 S.
doi:10.15495/EPub_UBT_00005192

Sascha Kurz: Designing codes for storage allocation.. - Bayreuth, 2020-12. - 30 S.
doi:10.15495/EPub_UBT_00005191

Sascha Kurz: Classification of 8-divisible binary linear codes with minimum distance 24.. - Bayreuth, 2020-12. - 53 S.
doi:10.15495/EPub_UBT_00005193

Sascha Kurz: Advanced and current topics in coding theory.. - Bayreuth, 2020-12. - 202 S.
doi:10.15495/EPub_UBT_00005204

Sascha Kurz, Sam Mattheus: A generalization of the cylinder conjecture for divisible codes.. - Bayreuth, 2020-11-05. - 16 S.
doi:10.15495/EPub_UBT_00005152

Sascha Kurz: Classification of indecomposable 2r-divisible codes spanned by by codewords of weight 2r.. - Bayreuth, 2020-11-11. - 7 S.
doi:10.15495/EPub_UBT_00005157

Romar dela Cruz, Sascha Kurz: On the maximum number of minimal codewords.. - Bayreuth, 2020-10-21. - 13 S.
doi:10.15495/EPub_UBT_00005128

Fatemeh Kazemi, Sascha Kurz, Emina Soljanin, Alex Sprintson: Efficient Storage Schemes for Desired Service Rate Regions.. - Bayreuth, 2020-10-21. - 5 S.
doi:10.15495/EPub_UBT_00005129

Sascha Kurz: On the number of minimal codewords in codes generated by the adjacency matrix of a graph.. - Bayreuth, 2020-06-04. - 11 S.
doi:10.15495/EPub_UBT_00004876

Sascha Kurz: A note on the growth of the dimension in complete simple games.. - Bayreuth, 2020-06-09. - 9 S.
doi:10.15495/EPub_UBT_00004878

Sascha Kurz: Are weighted games sufficiently good for binary voting?.. - Bayreuth, 2020-06-09. - 7 S.
doi:10.15495/EPub_UBT_00004880

Sascha Kurz: Generalized LMRD code bounds for constant dimension codes.. - Bayreuth, 2020-06-15. - 5 S.
doi:10.15495/EPub_UBT_00004886

Sascha Kurz: No projective $16$-divisible binary linear code of length $131$ exists.. - Bayreuth, 2020-06-18. - 4 S.
doi:10.15495/EPub_UBT_00004891

Romar dela Cruz, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: On the minimum number of minimal codewords.. - Bayreuth, 2020-05. - 9 S.
doi:10.15495/EPub_UBT_00004877

Sascha Kurz: Bounds for flag codes.. - Bayreuth, 2020-05-10. - 22 S.
doi:10.15495/EPub_UBT_00004845

Sascha Kurz: Lifted codes and the multilevel construction for constant dimension codes.. - Bayreuth, 2020-04-29. - 40 S.
doi:10.15495/EPub_UBT_00004840

Iliya Bouyukliev, Stefka Bouyuklieva, Sascha Kurz: Computer classification of linear codes.. - Bayreuth, 2020-02-18. - 18 S.
doi:10.15495/EPub_UBT_00004618

Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak: Subspace Packings : Constructions and Bounds.. - Bayreuth, 2020-01-02. - 30 S.

Michael Kiermaier, Sascha Kurz: On the lengths of divisible codes.. - Bayreuth, 2020-01-02. - 17 S.

Sascha Kurz: A note on the linkage construction for constant dimension codes.. - Bayreuth, 2020-01-06. - 9 S.

Sascha Kurz: The [46,9,20]₂ code is unique.. - Bayreuth, 2020-01-06. - 7 S.

Sascha Kurz, Eitan Yaakobi: PIR Codes with Short Block Length.. - Bayreuth, 2020-01-10. - 10 S.

Fatemeh Kazemi, Sascha Kurz, Emina Soljanin: A geometric view of the service rates of codes problem and its application to the service rate of the first order Reed-Muller codes.. - Bayreuth, 2020-01-16. - 8 S.

Sascha Kurz, Issofa Moyouwou, Hilaire Touyem: Axiomatizations for the Shapley-Shubik power index for games with several levels of approval in the input and output.. - Bayreuth, 2020-01-28. - 25 S.

Michael Kiermaier, Sascha Kurz: On the lengths of divisible codes.. - Bayreuth, 2020-01-30. - 17 S.

Vorträge

Fatemeh Kazemi, Sascha Kurz, Emina Soljanin: A geometric view of the service rates of codes problem and its application to the service rate of the first order Reed-Muller codes. - (Vortrag), Veranstaltung: IEEE International Symposium on Information Theory (ISIT) 2020, 21.-26.06.2020, Los Angeles, USA.

Sonstiges

Sascha Kurz, Jörg Rambau: Lösungshinweise zu den Übungsaufgaben "Mathematische Grundlagen für Wirtschaftswissenschaftler", 2020

2019

Artikel

Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: A subspace code of size 333 in the setting of a binary q-analog of the Fano plane. In: Advances in Mathematics of Communications, 13 (2019). - S. 457-475.
doi:10.3934/amc.2019029

Thomas Honold, Michael Kiermaier, Sascha Kurz: Johnson type bounds for mixed dimension subspace codes. In: The Electronic Journal of Combinatorics, 26 (2019). - .

Thomas Honold, Michael Kiermaier, Sascha Kurz: Classification of large partial plane spreads in PG(6,2) and related combinatorial objects. In: Journal of Geometry, 110 (2019). - S. 1-31.
doi:10.1007/s00022-018-0459-6

Josep Freixas, Sascha Kurz: Bounds for the Nakamura number. In: Social Choice and Welfare, 52 (2019). - S. 607-634.
doi:10.1007/s00355-018-1164-y

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. In: Designs, Codes and Cryptography, 87 (2019). - S. 375-391.
doi:10.1007/s10623-018-0544-8

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz: Generalized vector space partitions. In: The Australasian Journal of Combinatorics, 73 (2019). - S. 162-178.

Buchkapitel

Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak: Subspace packings. In: The Eleventh International Workshop on Coding and Cryptography 2019 : WCC Proceedings. - Saint-Jacut-de-la-Mer : 2019.

Marco Buratti, Michael Kiermaier, Sascha Kurz, Anamari Nakić, Alfred Wassermann: q-analogs of group divisible designs. In: Kai-Uwe Schmidt, Arne Winterhof (Hrsg.): Combinatorics and Finite Fields : Difference Sets, Polynomials, Pseudorandomness and Applications. - Berlin : De Gruyter, 2019.

Preprints

Michael Kiermaier, Sascha Kurz, Minjia Shi, Patrick Solé: Three-weight codes over rings and strongly walk regular graphs.. - Bayreuth, 2019-12-09. - 28 S.

Sascha Kurz: LinCode - computer classification of linear codes.. - Bayreuth, 2019-12-20. - 12 S.

Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Tables of subspace codes.. - Bayreuth, 2019-12-21. - 44 S.

Sascha Kurz, Reinhard Laue: Bounds for the minimum diameter of integral point sets.. - Bayreuth, 2019-11. - 8 S.

Sascha Kurz, Alexander Mayer, Stefan Napel: Weighted Committee Games.. - Bayreuth, 2019-10. - 25 S.

Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: The lengths of projective triply-even binary codes.. - Bayreuth, 2019-09. - 6 S.

Sascha Kurz: Bounds for the diameter of the weight polytope.. - Bayreuth, 2019-07-04. - 16 S.

Sascha Kurz: Subspaces intersecting in at most a point.. - Bayreuth, 2019-07-05. - 4 S.

Sascha Kurz, Issofa Moyouwou, Hilaire Touyem: An Axiomatization of the Shapley-Shubik Index for Interval Decisions.. - Bayreuth, 2019-06-30. - 28 S.

Marco Buratti, Michael Kiermaier, Sascha Kurz, Anamari Nakić, Alfred Wassermann: q-analogs of group divisible designs.. - Bayreuth, 2019-03-01. - 18 S.

Sascha Kurz: Which criteria qualify power indices for applications? : A comment to "The story of the poor Public Good index".. - Bayreuth, 2019-03-11. - 6 S.

Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: A subspace code of size 333 in the setting of a binary q-analog of the Fano plane.. - Bayreuth, 2019-01. - 18 S.

Thomas Honold, Michael Kiermaier, Sascha Kurz: Johnson type bounds for mixed dimension subspace codes.. - Bayreuth, 2019-01-16. - 16 S.

Sascha Kurz, Stefan Napel: Dimension of the Lisbon voting rules in the EU Council : a challenge and new world record.. - Bayreuth, 2019. - 8 S.

Vorträge

Sascha Kurz, Nicola Maaser, Stefan Napel: The Voting Weight of Nations. - (Programmrede), Veranstaltung: Australasian Public Choice Conference 2019, 09.-10.12.2019, Brisbane, Australia.

Sascha Kurz, Issofa Moyouwou, Hilaire Touyem: Decisions with a continuum of options. - (Vortrag), Veranstaltung: Application-Oriented Computational Social Choice, 15.-20.09.2019, Wadern, Deutschland.

Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Derived designs of q-Fano planes and q-analogs of group divisible designs. - (Vortrag), Veranstaltung: Academy Contact Forum: Coding Theory and Cryptography VIII, 2019-09-27, The royal Flemish academy of Belgium for science and arts, Brussels, Belgium.

Sascha Kurz, Alexander Mayer: Values under Uncertainty. - (Vortrag), Veranstaltung: 15th European Meeting on Game Theory 2019 : Sing15, 2-4.7.2019, Turku, Finland.

Jan de Beule, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: On q-analogs of group divisible designs. - (Vortrag), Veranstaltung: 9th Slovenian International Conference on Graph Theory, 23.-29.06.2019, Bled, Slovenia.

Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak: Subspace Packing. - (Vortrag), Veranstaltung: WCC 2019: The Eleventh International Workshop on Coding and Cryptography, 31.03.-05.04.2019, Saint-Jacut-de-la-Mer, France.

Sascha Kurz, Alexander Mayer, Stefan Napel: Influence in Weighted Committee Games : A Power Index, Rule Comparisons, and the IMF Executive Board. - (Vortrag), Veranstaltung: European Public Choice Society, 01.-04.04.2019, Jerusalem.

Sascha Kurz, Alexander Mayer, Stefan Napel: Weighted Committee Games. - (Vortrag), Veranstaltung: Individual Preferences and Social Choice, 11.-12.04.2019, Graz, Österreich.

2018

Artikel

Sascha Kurz, Stefan Napel: The roll call interpretation of the Shapley value. In: Economics Letters, 173 (2018). - S. 108-112.
doi:10.1016/j.econlet.2018.09.025

Sascha Kurz: Heden's bound on the tail of a vector space partition. In: Discrete Mathematics, 341 (2018). - S. 3447-3452.
doi:10.1016/j.disc.2018.09.003

Sascha Kurz: Correction to : On minimum sum representations for weighted voting games. In: Annals of Operations Research, 271 (2018). - S. 1087-1089.
doi:10.1007/s10479-018-2893-0

Daniel Heinlein, Sascha Kurz: Binary subspace codes in small ambient spaces. In: Advances in Mathematics of Communications, 12 (2018). - S. 817-839.
doi:10.3934/amc.2018048

Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard Woeginger: Group activity selection problem with approval preferences. In: International Journal of Game Theory, 47 (2018). - S. 767-796.
doi:10.1007/s00182-017-0596-4

Sascha Kurz: The power of the largest player. In: Economics Letters, 168 (2018). - S. 123-126.
doi:10.1016/j.econlet.2018.04.034

Serguei Kaniovski, Sascha Kurz: Representation-compatible power indices. In: Annals of Operations Research, 264 (2018). - S. 235-265.
doi:10.1007/s10479-017-2672-3

Sascha Kurz, Nicola Maaser, Stefan Napel: Fair representation and a linear Shapley rule. In: Games and Economic Behavior, 108 (2018). - S. 152-161.
doi:10.1016/j.geb.2017.10.002

Michael Kiermaier, Sascha Kurz, Alfred Wassermann: The order of the automorphism group of a binary q-analog of the Fano plane is at most two. In: Designs, Codes and Cryptography, 86 (2018). - S. 239-250.
doi:10.1007/s10623-017-0360-6

Sascha Kurz: Importance in systems with interval decisions. In: Advances in Complex Systems, 21 (2018). - .
doi:10.1142/S0219525918500248

Bücher

Sascha Kurz, Michael Stoll, Karl Worthmann: Angewandte Mathematik : ein Lehrbuch für Lehramtsstudierende. - Berlin : Springer, 2018. - XVIII + 210 S.
doi:10.1007/978-3-662-56705-0

Sascha Kurz, Jörg Rambau: Mathematische Grundlagen für Wirtschaftswissenschaftler. 3. Auflage. - Stuttgart : Kohlhammer, 2018. - 288 S.

Buchkapitel

Thomas Honold, Michael Kiermaier, Sascha Kurz: Partial Spreads and Vector Space Partitions. In: Marcus Greferath, Mario Osvin Pavčević, Natalia Silberstein, María Ángeles Vázquez-Castro (Hrsg.): Network Coding and Subspace Designs. - Cham : Springer, 2018. - S. 131-170.
doi:10.1007/978-3-319-70293-3_7

Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma: Simple Games versus Weighted Voting Games. In: Xiaotie Deng (Hrsg.): Algorithmic Game Theory : Proceedings. - Cham : Springer, 2018. - S. 69-81.
doi:10.1007/978-3-319-99660-8_7

Preprints

Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak: Subspace packings.. - Bayreuth, 2018-11-12. - 10 S.

Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma: Simple games versus weighted voting games: Bounding the critical threshold value.. - Bayreuth, 2018-10-20. - 10 S.

Sascha Kurz, Stefan Napel: The roll-call interpretation of the Shapley value with dependent cooperation.. - Bayreuth, 2018-08-08. - 15 S.

Sascha Kurz: Generalized roll-call model for the Shapley-Shubik index.. - Bayreuth, 2018-08-08. - 19 S.

Sascha Kurz: A note on limit results for the Penrose-Banzhaf index.. - Bayreuth, 2018-08-09. - 9 S.

Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma: Simple Games versus Weighted Voting Games.. - Bayreuth, 2018-05. - 13 S.

Sascha Kurz: On minimum sum representations for weighted voting games.. - Bayreuth, 2018-05. - 7 S.

Thomas Honold, Michael Kiermaier, Sascha Kurz: Classification of large partial plane spreads in PG(6,2) and related combinatorial objects.. - Bayreuth, 2018-05. - 31 S.

Sascha Kurz: Heden's bound on the tail of a vector space partition.. - Bayreuth, 2018-05-09. - 5 S.

Michael Kiermaier, Sascha Kurz: An improvement of the Johnson bound for subspace codes.. - Bayreuth, 2018-04. - 12 S.

Sascha Kurz: Correction to "On minimum sum representations for weighted voting games".. - Bayreuth, 2018-04. - 2 S.

Daniel Heinlein, Sascha Kurz: Binary subspace codes in small ambient spaces.. - Bayreuth, 2018-04-06. - 20 S.

Sascha Kurz: Influence in systems with convex decisions.. - Bayreuth, 2018-03. - 18 S.

Josep Freixas, Sascha Kurz: Bounds for the Nakamura number.. - Bayreuth, 2018-03. - 22 S.

Sascha Kurz: The power of the largest player.. - Bayreuth, 2018-03-13. - 7 S.

Sascha Kurz: Approximating power by weights.. - Bayreuth, 2018-02. - 21 S.

Vorträge

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: (Multi-)Sets of subspaces and divisible codes. - (Vortrag), Veranstaltung: Algebraic Coding Theory for Networks, Storage, and Security, 16-21.12.2018, Schloß Dagstuhl, Wadern.

Michael Kiermaier, Sascha Kurz: On the lengths of divisible codes. - (Vortrag), Veranstaltung: Kolloquium über Kombinatorik (KolKom), 23. bis 24. Nov. 2018, Universität Paderborn.

Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma: Simple Games versus Weighted Voting Games. - (Vortrag), Veranstaltung: 11th International Symposium on Algorithmic Game Theory, SAGT 2018, 11.-13.09.2018, Beijing, China.

Sascha Kurz: Limit theorems for power indices. - (Vortrag), Veranstaltung: 29th European Conference On Operational Research, 08.-11.07.2018, Valencia, Spain.

Sascha Kurz, Xavier Molinero, Stefan Napel, Martin Olsen, Matia Serna: Dimension of simple games and coding theory. - (Vortrag), Veranstaltung: European Meeting on Game Theory 2018 : Sing14, 16.-18.07.2018, Bayreuth.

Sascha Kurz, Alexander Mayer, Stefan Napel: Weighted Committee Games. - (Vortrag), Veranstaltung: SING14 - 14th European Meeting on Game Theory, 16.-18.07.2018, Bayreuth.

Sascha Kurz, Alexander Mayer, Stefan Napel: Weighted committee games. - (Vortrag), Veranstaltung: The 14th Meeting of the Society for Social Choice and Welfare, 14-17.06.2018, Seoul.

Sascha Kurz: Generalized roll-call model for the Shapley-Shubik index. - (Vortrag), Veranstaltung: 5. Workshop on Cooperative Game Theory in Business Practice - Financial Networks, 14.-15.06.2018, Leipzig.

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Random Linear Network Coding - Wissenschaftliches Rechnen für den 5G-Standard?. - (Vortrag), Veranstaltung: Modellierung und Simulation (MODUS), 2018, Bayreuth.

Sascha Kurz: Limit results for power indices. - (Vortrag), Veranstaltung: Mathematics and Politics : Democratic Decision Making, 28.-30.05.2018, Hannover, Germany.

Sascha Kurz, Alexander Mayer, Stefan Napel: Influence in Weighted Committee Games. - (Vortrag), Veranstaltung: Mathematics and Politics - Democratic Decision Making, 28.-30.05.2018, Hannover.

Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Tables of Subspacecodes. - (Poster), Veranstaltung: Munich Workshop on Coding and Cryptography 2018, 10.-11.04.2018, München.

Sascha Kurz, Alexander Mayer, Stefan Napel: Weighted Committee Games. - (Vortrag), Veranstaltung: European Public Choice Society, 11.-18.04.2018, Rome.

Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: q-Analoga von Designs, Subspace Codes und verwandte Objekte. - (Vortrag), Veranstaltung: Gemeinsame Jahrestagung GDMV 2018, 05.-09.03.2018, Paderborn.

Alfred Wassermann, Marco Buratti, Sascha Kurz, Anamari Nakić, Michael Kiermaier: q-analogs of group divisible designs. - (Vortrag), Veranstaltung: Discretaly: A Workshop in Discrete Mathematics, 1.-2.2.2018, Rome, Italy.

2017

Artikel

Josep Freixas, Marc Freixas, Sascha Kurz: On the characterization of weighted simple games. In: Theory and Decision, 83 (2017). - S. 469-498.
doi:10.1007/s11238-017-9606-z

Daniel Heinlein, Sascha Kurz: Coset Construction for Subspace Codes. In: IEEE Transactions on Information Theory, 63 (2017). - S. 7651-7660.
doi:10.1109/TIT.2017.2753822

Sascha Kurz: Improved upper bounds for partial spreads. In: Designs, Codes and Cryptography, 85 (2017). - S. 97-106.
doi:10.1007/s10623-016-0290-8

Sascha Kurz: Packing vector spaces into vector spaces. In: The Australasian Journal of Combinatorics, 68 (2017). - S. 122-130.

Maurice Koster, Sascha Kurz, Ines Lindner, Stefan Napel: The prediction value. In: Social Choice and Welfare, 48 (2017). - S. 433-460.
doi:10.1007/s00355-016-1012-x

Sascha Kurz, Nicola Maaser, Stefan Napel: On the Democratic Weights of Nations. In: Journal of Political Economy, 125 (2017). - S. 1599-1634.
doi:10.1086/693039

Buchkapitel

Daniel Heinlein, Sascha Kurz: An upper bound for binary subspace codes of length 8, constant dimension 4 and minimum distance 6. In: Daniel Augot, Evgeny Krouk, Pierre Loidreau (Hrsg.): The Tenth International Workshop on Coding and Cryptography 2017 : WCC Proceedings. - Saint-Petersburg : 2017.

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Projective divisible binary codes. In: Daniel Augot, Evgeny Krouk, Pierre Loidreau (Hrsg.): The Tenth International Workshop on Coding and Cryptography 2017 : WCC Proceedings. - Saint-Petersburg : 2017.

Daniel Heinlein, Sascha Kurz: Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound. In: Ángela I. Barbero, Vitaly Skachek, Øyvind Ytrehus (Hrsg.): Coding Theory and Applications : 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings. - Cham : Springer International Publishing, 2017. - S. 163-191.
doi:10.1007/978-3-319-66278-7_15

Isabella Hoffmann, Sascha Kurz, Jörg Rambau: The Maximum Scatter TSP on a Regular Grid. In: Karl Franz Doerner, Ivana Ljubic, Georg Pflug, Gernot Tragler (Hrsg.): Operations Research Proceedings 2015. - Cham : Springer, 2017. - S. 63-70.
doi:10.1007/978-3-319-42902-1_9

Preprints

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6.. - Bayreuth, 2017-11. - 16 S.

Daniel Heinlein, Sascha Kurz: Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound.. - Bayreuth, 2017-05. - 30 S.

Sascha Kurz: Upper bounds for partial spreads.. - Bayreuth, 2017-03. - 4 S.

Daniel Heinlein, Sascha Kurz: A new upper bound for subspace codes.. - Bayreuth, 2017-03. - 9 S.

Josep Freixas, Marc Freixas, Sascha Kurz: Characterization of threshold functions : state of the art, some new contributions and open problems.. - Bayreuth, 2017-03. - 26 S.

Thomas Honold, Michael Kiermaier, Sascha Kurz: Partial spreads and vector space partitions.. - Bayreuth, 2017-03-17. - 30 S.

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Projective divisible binary codes.. - Bayreuth, 2017-03-23. - 10 S.

Vorträge

Sascha Kurz, Daniel Heinlein, Thomas Honold, Michael Kiermaier, Alfred Wassermann: Upper bounds for constant dimension codes. - (Vortrag), Veranstaltung: Academy Contact Forum "Coding Theory and Cryptography VII", 06.10.2017, Brüssel, Belgien.

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Classification of optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. - (Vortrag), Veranstaltung: WCC 2017, 18 - 22 September 2017, Saint Petersburg, Russia.

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Projective divisible binary codes. - (Vortrag), Veranstaltung: WCC 2017, 18 - 22 September 2017, Saint Petersburg, Russia.

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Classification of optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. - (Vortrag), Veranstaltung: 5th ICMCTA, 28 - 31 August 2017, Vihula Manor, Estonia.

Daniel Heinlein, Sascha Kurz: Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound. - (Vortrag), Veranstaltung: 5th ICMCTA, 28 - 31 August 2017, Vihula Manor, Estonia.

Sascha Kurz: Measuring voting power in continuous policy spaces. - (Vortrag), Veranstaltung: Interdisciplinary Workshop on Opinion Dynamics and Collective Decision 2017, 05.-07.07.2017, Bremen.

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Upper bounds for partial spreads from divisible codes. - (Vortrag), Veranstaltung: The 13th International Conference on Finite Fields and their Applications, 04.-10.06.2017, Gaeta, Italy.

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: The linear programming method for partial spreads. - (Vortrag), Veranstaltung: Summer School on Finite Geometry, 26 - 30 June 2017, Brighton.

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Upper bounds for partial spreads. - (Vortrag), Veranstaltung: Computeralgebra-Tagung 2017, 04.-06.05.2017, Kassel, Deutschland.

Sascha Kurz: Diskrete Strukturen und algorithmische 2017 Mathematik. - (Vorlesung), Veranstaltung: Faszination Wirtschaftsmathematik, 03.04.2017, Rosenheim.

2016

Artikel

Thomas Honold, Michael Kiermaier, Sascha Kurz: Constructions and bounds for mixed-dimension subspace codes. In: Advances in Mathematics of Communications, 10 (2016). - S. 649-682.
doi:10.3934/amc.2016033

Sascha Kurz, Stefan Napel: Dimension of the Lisbon voting rules in the EU Council : a challenge and new world record. In: Optimization Letters, 10 (2016). - S. 1245-1256.
doi:10.1007/s11590-015-0917-0

María García-Valiñas, Sascha Kurz, Vera Zaporozhets: Key Drivers of EU Budget Allocation : Does Power Matter?. In: European Journal of Political Economy, 43 (2016). - S. 57-70.
doi:10.1016/j.ejpoleco.2016.02.004

Josep Freixas, Sascha Kurz: The cost of getting local monotonicity. In: European Journal of Operational Research, 251 (2016). - S. 600-612.
doi:10.1016/j.ejor.2015.11.030

Sascha Kurz: The inverse problem for power distributions in committees. In: Social Choice and Welfare, 47 (2016). - S. 65-88.
doi:10.1007/s00355-015-0946-8

Sascha Kurz, Xavier Molinero, Martin Olsen, Maria Serna: Dimension and Codimension of Simple Games. In: Electronic Notes in Discrete Mathematics, 55 (2016). - S. 147-150.
doi:10.1016/j.endm.2016.10.037

Buchkapitel

Sascha Kurz: The price of fairness for a small number of indivisible items. In: Marco Lübbecke, Arie Koster, Peter Letmathe, Reinhard Madlener, Britta Peis, Grit Walther (Hrsg.): Operations Research Proceedings 2014. - Cham : Springer, 2016. - S. 335-340.
doi:10.1007/978-3-319-28697-6_47

Sascha Kurz, Xavier Molinero, Martin Olsen: On the construction of high dimensional simple games. In: Gal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hüllermeier, Virginia Dignum, Frank Dignum, Frank van Harmelen (Hrsg.): ECAI 2016 : 22nd European Conference on Artificial Intelligence ; proceedings. - New York : IOS Press, 2016. - S. 880-885.

Preprints

Sascha Kurz: Improved upper bounds for partial spreads.. - Bayreuth, 2016-12. - 8 S.

Thomas Honold, Michael Kiermaier, Sascha Kurz: Constructions and Bounds for Mixed-Dimension Subspace Codes.. - Bayreuth, 2016-12. - 35 S.

Sascha Kurz, Nicola Maaser, Stefan Napel: Fair Representation and a Linear Shapley Rule.. - Bayreuth, 2016-10-18. - 20 S.

Martin Olsen, Sascha Kurz, Xavier Molinero: On the Construction of High Dimensional Simple Games.. - Bayreuth, 2016-07. - 13 S.

Sascha Kurz: Computing the Power Distribution in the IMF.. - Bayreuth, 2016-03. - 19 S.

Sascha Kurz, Xavier Molinero, Martin Olsen, Maria Serna: Dimension and codimension of simple games.. - Bayreuth, 2016-02-13. - 5 S.

Michael Kiermaier, Sascha Kurz, Alfred Wassermann: The order of the automorphism group of a binary q-analog of the Fano plane is at most two.. - Bayreuth, 2016. - 10 S.

Vorträge

Sascha Kurz, Stefan Napel: Dimension of the Lisbon voting rules in the EU Council : a challenge and new world record Optimization. - (Vortrag), Veranstaltung: Workshop on Political Economy, 17.-19.11.2016, Bayreuth.

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Subspace codes. - (Vortrag), Veranstaltung: Workshop in coding theory and cryptography, 21.11.2016, Brussels.

Sascha Kurz, Xavier Molinero, Martin Olsen: On the Construction of High Dimensional Simple Games. - (Vortrag), Veranstaltung: 22. European Conference on Artificial Intelligence (ECAI) 2016, 29.08-02.09.2016, The Hague, Holland.

Sascha Kurz, Xavier Molinero, Martin Olsen, Maria Serna: Dimension and codimension of simple games. - (Vortrag), Veranstaltung: Cologne Twente Workshop 2016, 06.-08.06.2016, Gargnano, Italy.

Sascha Kurz: Improved upper bounds for partial spreads. - (Vortrag), Veranstaltung: Network Coding and Designs, 4.-8.04.2016, Dubrovnik, Kroatien.

Daniel Heinlein, Sascha Kurz: Coset Construction for Subspace Codes. - (Vortrag), Veranstaltung: Network Coding and Designs, 4.-8.04.2016, Dubrovnik, Kroatien.

2015

Artikel

Sascha Kurz, Jörg Rambau, Jörg Schlüchtermann, Rainer-Johannes Wolf: 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. In: Annals of Operations Research, 229 (2015). - S. 541-563.
doi:10.1007/s10479-014-1746-8

Rainer Hegselmann, Stefan König, Sascha Kurz, Christoph Niemann, Jörg Rambau: Optimal Opinion Control : The Campaign Problem. In: Journal of Artificial Societies and Social Simulation, 18 (2015). - S. 1-47.

Vadim Kartak, Sascha Kurz, Guntram Scheithauer, Artem Ripatti: Minimal proper non-IRUP instances of the one-dimensional Cutting Stock Problem. In: Discrete Applied Mathematics, 187 (2015). - S. 120-129.
doi:10.1016/j.dam.2015.02.020

Sascha Kurz: Ready for the design of voting rules?. In: Homo Oeconomicus, 32 (2015). - S. 117-129.

Sascha Kurz: Optimal control of the freezing time in the Hegselmann--Krause dynamics. In: Journal of Difference Equations and Applications, 21 (2015). - S. 633-648.
doi:10.1080/10236198.2015.1045890

Sascha Kurz, Nicola Maaser, Stefan Napel, Matthias Weber: Mostly sunny : a forecast of tomorrow's power index research. In: Homo Oeconomicus, 32 (2015). - S. 133-146.

Serguei Kaniovski, Sascha Kurz: The average representation : a cornucopia of power indices?. In: Homo Oeconomicus, 32 (2015). - S. 169-182.

Buchkapitel

Thomas Honold, Michael Kiermaier, Sascha Kurz: Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4. In: Kyureghyan, Gohar ; Mullen, Gary L. ; Pott, Alexander (Hrsg.): Topics in Finite Fields. - Providence, Rhode Island : American Mathematical Society, 2015. - S. 157-176.
doi:10.1090/conm/632/12627

Preprints

Sascha Kurz, María García-Valiñas, Vera Zaporozhets: Key drivers of EU budget allocation: Does power matter?.. - Bayreuth, 2015-12. - 32 S.

Daniel Heinlein, Sascha Kurz: Coset construction for subspace codes.. - Bayreuth, 2015-12. - 17 S.

Serguei Kaniovski, Sascha Kurz: Representation-compatible power indices.. - Bayreuth, 2015-06. - 28 S.

Rainer Hegselmann, Stefan König, Sascha Kurz, Christoph Niemann, Jörg Rambau: Optimal Opinion Control : The Campaign Problem.. - Bayreuth, 2015-02-27. - 47 S.

Isabella Hoffmann, Sascha Kurz, Jörg Rambau: The Maximum Scatter TSP on a Regular Grid.. - Bayreuth, 2015. - 6 S.

Vorträge

Thomas Honold, Michael Kiermaier, Sascha Kurz: Improved bounds and classification results for binary subspace codes. - (Vortrag), Veranstaltung: 7th Workshop on Coding and Systems, 01.-03.07.2015, Salamanca, Spain.

Sascha Kurz, Stefan Napel: Dimension of the European Union Council according to the Lisbon Treaty. - (Vortrag), Veranstaltung: 27th European Conference on Operational Research, 12.-15.07.2015, Glasgow, Scotland.

Serguei Kaniovski, Sascha Kurz: Representation compatible power indices. - (Vortrag), Veranstaltung: 27th European Conference on Operational Research, 12.-15.07.2015, Glasgow, Scotland.

Jörg Rambau, Rainer Hegselmann, Stefan König, Sascha Kurz, Christoph Niemann: Optimal control and the campaign problem. - (Vortrag), Veranstaltung: 27th European Conference on Operational Research, 12.-15.07.2015, Glasgow, Scotland.

Maurice Koster, Sascha Kurz, Ines Lindner, Stefan Napel: The Prediction Value. - (Vortrag), Veranstaltung: CoopMAS 2015 - The Sixth Workshop on Cooperative Games in Multiagent Systmes, 04.-05.05.2015, Istanbul, Turkey.

Serguei Kaniovski, Sascha Kurz: The average representation : a cornucopia of power indices?. - (Vortrag), Veranstaltung: The 2015 Annual Meeting of the European Public Choice Society, 07.-10.04.2015, Groningen, The Netherlands.

Isabella Hoffmann, Sascha Kurz, Jörg Rambau: Approximation of the Maximum Scatter TSP. - (Poster), Veranstaltung: WIO - Women in Optimization, 02.-04.03.2015, Heidelberg, Deutschland.

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann: Towards a classification of special partial spreads and subspace codes. - (Vortrag), Veranstaltung: Algebraic combinatorics and applications - ALCOMA 2015, 15.-20.-03.2015, Kloster Banz, Germany.

Thomas Honold, Michael Kiermaier, Sascha Kurz: ILP techniques for binary subspace codes. - (Vortrag), Veranstaltung: Algebraic combinatorics and applications - ALCOMA 2015, 15.-20-03.2015, Kloster Banz, Germany.

Sascha Kurz: Optimal control of opinion dynamics. - (Vortrag), Veranstaltung: Mathematisches Kolloquium - Mathematical Colloquium : Oberseminar Wissenschaftliches Rechnen, 04.02.2015, Würzburg, Deutschland.

Sascha Kurz, Stefan Napel: Dimension of the European Union Council according to the Lisbon Treaty. - (Vortrag), Veranstaltung: 2nd German Day on Computational Game Theory, 10.-11.02.2015, Berlin, Deutschland.

2014

Artikel

Sascha Kurz: How long does it take to consensus in the Hegselmann-Krause model?. In: Proceedings in Applied Mathematics and Mechanics, 14 (2014). - S. 803-804.
doi:10.1002/pamm.201410382

Stefan Napel, Andreas Nohn, Sascha Kurz: The Nucleolus of Large Majority Games. In: Economics Letters, 123 (2014). - S. 139-143.
doi:10.1016/j.econlet.2014.01.041

Josep Freixas, Sascha Kurz: On minimum integer representations of weighted games. In: Mathematical Social Sciences, 67 (2014). - S. 9 - 22.
doi:10.1016/j.mathsocsci.2013.10.005

Josep Freixas, Sascha Kurz: On alpha-roughly weighted games. In: International Journal of Game Theory, 43 (2014). - S. 659-692.
doi:10.1007/s00182-013-0402-x

Sascha Kurz: Measuring Voting Power in Convex Policy Spaces. In: Economies, 2 (2014). - S. 45-77.
doi:10.3390/economies2010045

Sascha Kurz, Stefan Napel: Heuristic and exact solutions to the inverse power index problem for small voting bodies. In: Annals of Operations Research, 215 (2014). - S. 137-163.
doi:10.1007/s10479-012-1293-0

Josep Freixas, Sascha Kurz: Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum. In: Annals of Operations Research, 222 (2014). - S. 317-339.
doi:10.1007/s10479-013-1348-x

Sascha Kurz, Landon Curt Noll, Randall Rathbun, Chuck Simmons: Constructing 7-clusters. In: Serdica Journal of Computing, 8 (2014). - S. 47-70.

Buchkapitel

Sascha Kurz, Valery Mishkin: Large-volume open sets in normed spaces without integral distances. In: EuroCG 2013 : The 29th European Workshop on Computational Geometry ; March 17-20, 2013. - Braunschwieg : 2014. - S. 209-2012.

Miriam Kießling, Tobias Kreisel, Sascha Kurz, Jörg Rambau: Evaluation of a new supply strategy based on stochastic programming for a fashion discounter. In: Helber, Stefan (Hrsg.): Operations Research Proceedings 2012. - Cham : Springer, 2014. - S. 515-520.
doi:10.1007/978-3-319-00795-3_77

Preprints

Thomas Honold, Michael Kiermaier, Sascha Kurz: Optimal binary subspace codes of length 6, constant dimension 3 and minimum distance 4.. - Bayreuth, 2014-11. - 24 S.

Sascha Kurz: Optimal control of the convergence time in the Hegselmann-Krause dynamics.. - Bayreuth, 2014-11-18. - 14 S.

Sascha Kurz, Nicola Maaser, Stefan Napel, Matthias Weber: Mostly sunny : a forecast of tomorrow's power index research.. - Bayreuth, 2014-05-05. - 17 S.

Sascha Kurz, Landon Curt Noll, Randall Rathbun, Chuck Simmons: Constructing 7-clusters.. - Bayreuth, 2014. - 15 S.

Sascha Kurz, Nikolas Tautenhahn: Classes of complete simple games that are all weighted.. - Bayreuth, 2014. -

Vorträge

Maurice Koster, Sascha Kurz, Ines Lindner, Stefan Napel: The prediction value. - (Vortrag), Veranstaltung: European Social Networks Conference, 01.-04.07.2014, Barcelona, Spanien.

Sascha Kurz: Optimale Strategien für Schere, Stein, Papier. - (Vorlesung), Veranstaltung: Tag der Begabtenförderung der Gymnasien in Oberfranken, 07.07.2014, Bindlach, Deutschland.

Josep Freixas, Sascha Kurz: Fibonacci sequences and the golden number in voting systems. - (Vortrag), Veranstaltung: 16th International Conference on Fibonacci Numbers and their Applications, 20.-26.07.2014, Rochester, New York.

Sascha Kurz: Price of fairness for indivisible goods. - (Vortrag), Veranstaltung: Workshop on fair division, voting and computational complexity, 28.-30.04.2014, Graz, Österreich.

Sascha Kurz: Optimal control of opinion dynamics. - (Vortrag), Veranstaltung: GAMM 2014 - 85th Annual Meeting of the International Association of Applied Mathematics and Mechanics, 10.-14.03.2014, Erlangen, Deutschland.

Nikolas Tautenhahn, Sascha Kurz: Classes of complete simple games that are all weighted. - (Vortrag), Veranstaltung: 3rd International Conference on Operations Research and Enterprise Systems : ICORES 2014, 06.-08.03.2014, Angers, France.

Sascha Kurz: The inverse problem for power distributions in committees. - (Vortrag), Veranstaltung: 1st German Day on Computational Game Theory, 13.02.2014, Paderborn, Deutschland.

2013

Artikel

Sascha Kurz, Valery Mishkin: Open sets avoiding integral distances. In: Discrete & Computational Geometry, 50 (2013). - S. 99-123.

Sascha Kurz, Nikolas Tautenhahn: On Dedekind’s problem for complete simple games. In: International Journal of Game Theory, 42 (2013). - S. 411-437.
doi:10.1007/s00182-012-0327-9

Josep Freixas, Sascha Kurz: The golden number and Fibonacci sequences in the design of voting structures. In: European Journal of Operational Research, 226 (2013). - S. 246-257.

Vorträge

Sascha Kurz, Valery Mishkin: Large-volume open sets in normed spaces without integral distances. - (Vortrag), Veranstaltung: EuroCG 2013, 17.-20.03.2013, Braunschweig, Deutschland.

Sascha Kurz: On the limit behavior of the nucleolus. - (Vortrag), Veranstaltung: Research seminar of the Game Theory Research Group, 26.02.2013, Manresa, Catalonia, Spain.

2012

Artikel

Miriam Kießling, Sascha Kurz, Jörg Rambau: The Integrated Size and Price Optimization problem. In: Numerical Algebra, Control and Optimization, 2 (2012). - S. 669-693.
doi:10.3934/naco.2012.2.669

Miriam Kießling, Tobias Kreisel, Sascha Kurz, Jörg Rambau, Konrad Schade, Cornelius Schwarz: Das Optimierungslabor : ein Erfahrungsbericht. In: Der Mathematikunterricht, 58 (2012). - S. 18-29.

Sascha Kurz: Squaring the square with integer linear programming. In: Journal of Information Processing, 20 (2012). - S. 680-685.
doi:10.2197/ipsjjip.20.680

Sascha Kurz: On the inverse power index problem. In: Optimization, 61 (2012). - S. 989-1011.

Sascha Kurz: On minimum sum representations for weighted voting games. In: Annals of Operations Research, 196 (2012). - S. 361-369.
doi:10.1007/s10479-012-1108-3

Sascha Kurz, Martin Lätsch: Bounds for the minimum oriented diameter. In: Discrete Mathematics and Theoretical Computer Science, 14 (2012). - S. 109-140.

Bücher

Sascha Kurz, Jörg Rambau: Mathematische Grundlagen für Wirtschaftswissenschaftler. 2. Auflage. - Stuttgart : Kohlhammer, 2012. - XI, 273 S.

Buchkapitel

Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger: Group Activity Selection Problem. In: Goldberg, Paul (Hrsg.): Internet and network economics. - Berlin : Springer, 2012. - S. 156-169.

Sascha Kurz: Competitive learning of monotone Boolean functions. In: Suhl, Leena; Mitra, Gautam et al. (Hrsg.): Applied Mathematical Optimization and Modelling: APMOD 2012 Extended Abstracts, University of Paderborn, Germany 2012. - Paderborn : 2012. - S. 416-421.

Preprints

Miriam Kießling, Sascha Kurz, Jörg Rambau: An exact column-generation approach for the lot-type design problem.. - Bayreuth, 2012. - 15 S.

Vorträge

Jérôme Lang, Andreas Darmann, Edith Elkind, Sascha Kurz, Joachim Schauer, Gerhard J. Woeginger: Group Activity Selection Problem. - (Vortrag), Veranstaltung: Fourth International Workshop on Computational Social Choice : COSMOC 2012, 11.-13.09.2012, Kraków, Poland.

Sascha Kurz: Finding extremal voting systems via integer linear programming. - (Vortrag), Veranstaltung: 25th European Conference on Operational Research (EURO XXV), 08.-11.07.2012, Vilnius, Litauen.

Josep Freixas, Sascha Kurz: Enumerations of voting systems : Fibonacci sequences and the golden number. - (Vortrag), Veranstaltung: 25th European Conference on Operational Research, 08.-11.07.2012, Vilnius, Lithuania.

Maurice Koster, Sascha Kurz, Ines Lindner, Stefan Napel: Conditional prediction values. - (Vortrag), Veranstaltung: SING 8 - The 8th Spain-Italy-Netherlands Meeting on Game Theory, 16.-18.07.2012, Budapest, Ungarn.

Sascha Kurz: Sets avoiding integral distances. - (Vortrag), Veranstaltung: Mittagsseminar AI6 & AI7, 09.05.2012, Bayreuth.

Sascha Kurz, Miriam Kießling, Jörg Rambau: An exact column-generation approach for the lot-type design problem. - (Vortrag), Veranstaltung: 2nd International Symposium on Combinatorial Optimization (ISCO 2012), 18.-21.04.2012, Athen, Griechenland.

Sascha Kurz: Finding extremal voting systems via integer linear programming. - (Vortrag), Veranstaltung: Dagstuhl-Seminar Computation and Incentives in Social Choice, 04.-09.03.2012, Wadern, Deutschland.

Sascha Kurz: Competitive learning of monotone Boolean functions. - (Vortrag), Veranstaltung: APMOD 2012 (International Conference on Applied Mathematical Optimization and Modelling), 28.-30.03.2012, Paderborn.

Miriam Kießling, Sascha Kurz, Jörg Rambau: ISPO : an integrated size and price optimization for a fashion discounter with many branches. - (Vortrag), Veranstaltung: 16th Combinatorial Optimization Workshop, 09.-13.01.2012, Aussois, Frankreich.

2011

Artikel

Sascha Kurz, Rom Pinchasi: Regular matchstick graphs. In: The American Mathematical Monthly, 118 (2011). - S. 264-268.

Sascha Kurz, Alfred Wassermann: On the minimum diameter of plane integral point sets. In: Ars Combinatoria, 101 (2011). - S. 265-287.

Sascha Kurz, Jörg Rambau: On the Hegselmann-Krause conjecture in opinion dynamics. In: Journal of Difference Equations and Applications, 17 (2011). - S. 859-876.

Sascha Kurz: A lower bound for 4-regular planar unit distance graphs. In: Geombinatorics Quarterly, 21 (2011). - S. 63-72.

Sascha Kurz: Fast regocnition of planar non unit distance graphs. In: Geombinatorics Quarterly, 21 (2011). - S. 25-33.

Michael Kiermaier, Matthias Koch, Sascha Kurz: 2-arcs of maximal size in the affine and the projective Hjelmslev plane over Z25. In: Advances in Mathematics of Communications, 5 (2011). - S. 287-301.
doi:10.3934/amc.2011.5.287

Vorträge

Sascha Kurz, Josep Freixas: Alpha-roughly weighted monotone Boolean functions. - (Vortrag), Veranstaltung: Colloquium on Combinatorics 2011, 11.-12.11.2011, Magdeburg.

Sascha Kurz: Über das inverse Machtindexproblem. - (Vortrag), Veranstaltung: 1. Süddeutsches Power-Meeting, 18.11.2011, Augsburg.

Miriam Kießling, Tobias Kreisel, Sascha Kurz, Jörg Rambau: Evaluation of supply strategies for a fashion discounter. - (Vortrag), Veranstaltung: OR 2011 - International Conference on Operations Research, 30.08.-02.09.2011, Zürich, Schweiz.

Josep Freixas, Sascha Kurz: On minimal integer representations of weighted games. - (Vortrag), Veranstaltung: 24th European Chapter on Combinatorial Optimization, 30.05.-01.06.2011, Amsterdam, Niederlande.

2010

Artikel

Andrey Radoslavov Antonov, Sascha Kurz: Maximal integral point sets over Z2. In: International Journal of Computer Mathematics, 87 (2010). - S. 2653-2676.

Vorträge

Miriam Kießling, Sascha Kurz, Jörg Rambau: Integrierte Größen- und Preisoptimierung bei einem Textildiscounter. - (Vortrag), Veranstaltung: 14. Workshop Future Research in Combinatorial Optimization, 22.-25.09.2010, Graz, Österreich.

Sascha Kurz: The inverse power index problem. - (Vortrag), Veranstaltung: 24th European Conference on Operational Research (EURO XXIV), 11.-14.07.2010, Lissabon, Portugal.

Sascha Kurz: On unit-distance graphs. - (Vortrag), Veranstaltung: 44. Gemeinsame Jahrestagung von DMV und GDM : Minisymposium "Discrete Geometry & Discrete Topology", 08.-12.03.2010, München.

2009

Artikel

Axel Kohnert, Sascha Kurz: Integral point sets over Z_n^m. In: Discrete Applied Mathematics, 157 (2009). - S. 2105-2117.
doi:10.1016/j.dam.2007.10.019

Michael Kiermaier, Sascha Kurz: Maximal integral point sets in affine planes over finite fields. In: Discrete Mathematics, 309 (2009). - S. 4564-4575.
doi:10.1016/j.disc.2009.02.020

Sascha Kurz: Integral point sets over finite fields. In: The Australasian Journal of Combinatorics, 43 (2009). - S. 3-29.

Sascha Kurz, Harald Meyer: Integral point sets in higher dimensional affine spaces over finite fields. In: Journal of Combinatorial Theory, Series A, 116 (2009). - S. 1120-1140.

Sascha Kurz: CAPS in Z (2, n). In: Serdica Journal of Computing, 3 (2009). - S. 159-178.

Sascha Kurz, Giuseppe Mazzuoccolo: 3-regular matchstick graphs with given girth. In: Geombinatorics Quarterly, 19 (2009). - S. 156-173.

Bücher

Sascha Kurz, Jörg Rambau: Mathematische Grundlagen für Wirtschaftswissenschaftler. - Stuttgart : Kohlhammer, 2009.

Buchkapitel

Constantin Gaul, Sascha Kurz, Jörg Rambau: The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts. In: Models and Algorithms for Optimization in Logistics. - Dagstuhl, Germany : Schloss Dagstuhl — Leibniz-Zentrum für Informatik, Germany, 2009.

Vorträge

Sascha Kurz: Enumeration of complete simple games and weighted voting games. - (Vortrag), Veranstaltung: Colloquium on Combinatorics 2009, 12-14.11.2009, Magdeburg.

Sascha Kurz: Optimal Control of Opinion-forming Dynamics. - (Vortrag), Veranstaltung: 20th International Symposium of Mathematical Programming, 23.-28.08.2009, Chigaco, USA.

2008

Artikel

Tobias Kreisel, Sascha Kurz: There Are Integral Heptagons, no Three Points on a Line, no Four on a Circle. In: Discrete & Computational Geometry, 39 (2008). - S. 786-790.
doi:10.1007/s00454-007-9038-6

Sascha Kurz: On the generation of Heronian triangles. In: Serdica Journal of Computing, 2 (2008). - S. 181-196.

Sascha Kurz: Counting polyominoes with minimum perimeter. In: Ars Combinatoria, 88 (2008). - S. 161-174.

Sascha Kurz: Convex hulls of polyominoes. In: Beiträge zur Algebra und Geometrie = Contributions to Algebra and Geometry, 49 (2008). - S. 125-136.

Buchkapitel

Axel Kohnert, Sascha Kurz: Construction of large constant dimension codes with a prescribed minimum distance. In: Jacques Calmet, Willi Geiselmann and Jörn Müller-Quade (Hrsg.): Mathematical methods in computer science: essays in memory of Thomas Beth. - Berlin : Springer, 2008. - S. 31-42.

Habitilationsschrift

Sascha Kurz: Discrete Structures, Algorithms, and Applications. - Bayreuth, 2008. 159 S.
(, 2008, Universität Bayreuth)

Preprints

Sascha Kurz, Jörg Rambau, Jörg Schlüchtermann, Rainer-Johannes Wolf: 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.. - Bayreuth, 2008. - 22 S.

Vorträge

Sascha Kurz: Regular matchstick graphs. - (Vortrag), Veranstaltung: Colloquium on Combinatorics 2008, 14.-15.11.2008, Magdeburg.

Sascha Kurz, Martin Lätsch: Bounds for the minimum oriented diameter. - (Vortrag), Veranstaltung: Operations Research 2008, 3.-5.9.2008, Augsburg.

Sonstiges

Sascha Kurz: Die rätselhafte Seite der Mathematik, Spektrum, 5: 2008

Sascha Kurz: Mathematik zur Entspannung - The Lighter Side of Mathematics, Spektrum, 44-47: 2008

2007

Artikel

Constantin Gaul, Sascha Kurz, Jörg Rambau: On the lot-type design problem. In: Optimization Methods and Software, 25 (2007). - S. 217-227.

Axel Kohnert, Sascha Kurz: A note on Erdős-Diophantine graphs and Diophantine carpets. In: Mathematica Balkanica. New Series, 21 (2007). - S. 1-5.

Sascha Kurz: Enumeration of integral tetrahedra. In: Journal of Integer Sequences, 10 (2007). - .

Sascha Kurz, Reinhard Laue: Bounds for the minimum diameter of integral point sets. In: The Australasian Journal of Combinatorics, 39 (2007). - S. 233-240.

Buchkapitel

Sascha Kurz, Jörg Rambau: Demand forecasting for companies with many branches, low sales numbers per product, and non-recurring orderings. In: Macedo Mourelle, Luiza de (Hrsg.): Proceedings of the 7th International Conference on Intelligent Systems Design and Applications. - Los Alamitos, CA, USA : IEEE Computer Society, 2007. - S. 196-204.

Vorträge

Sascha Kurz, Jörg Rambau: The Top-Dog Index : A New Measurement of the Size Distribution in Pre-Pack Orders for a Fashion Discounter. - (Vortrag), Veranstaltung: 22th European Conference on Operational Research, 08.-11.07.2007, Prague, Czech Republic.

Sascha Kurz: Integral point sets over finite fields. - (Vortrag), Veranstaltung: 1. Workshop on Integral Figure Geometry, 05.-12.10.2007, Sofia, Bulgarien.

Sascha Kurz: Integral point sets in Euclidean spaces. - (Vortrag), Veranstaltung: 1. Workshop on Integral Figure Geometry, 05.-12.10.2007, Sofia, Bulgarien.

Sascha Kurz, Jörg Rambau: Demand forecasting for companies with many branches, low sales numbers per product, and non-recurring orderings. - (Vortrag), Veranstaltung: 7th International Conference on Intelligent Systems Design and Applications, 22.-24.10.2007, Rio de Janeiro, Brasilien.

Sascha Kurz: Integral point sets over finite fields. - (Vortrag), Veranstaltung: Ottawa-Carleton Discrete Mathematics Workshop 2007, 25.-26.05.2007, Ottawa, Canada.

Sascha Kurz: Integral point sets. - (Vortrag), Veranstaltung: 1st Canadian Discrete and Algorithmic Mathematics Conference, 28.-31.05.2007, Banff, Canada.

2006

Artikel

Sascha Kurz: On the characteristic of integral point sets in E^m. In: The Australasian Journal of Combinatorics, 36 (2006). - S. 241-248.

Axel Kohnert, Sascha Kurz: Integral point sets over Z_n^m. In: Electronic Notes in Discrete Mathematics, 27 (2006). - S. 65-66.
doi:10.1016/j.endm.2006.08.058

Christian Haase, Sascha Kurz: A bijection between the d-dimensional simplices with distances in b;1, 2d; and the partitions of d + 1. In: Journal of Combinatorial Theory, Series A, 113 (2006). - S. 736-738.
doi:10.1016/j.jcta.2005.05.009

Vorträge

Sascha Kurz: Integral point sets over Z_p^2. - (Vortrag), Veranstaltung: Colloquium on Combinatorics 2006, 16.-18.11.2006, Magdeburg, Deutschland.

Sascha Kurz: Polyominoes with maximum convex hull. - (Vortrag), Veranstaltung: 10. Workshop über Future Research in Combinatorial Optimization (FRICO 2006), 14.-17.09.2006, Chemnitz, Deutschland.

Sascha Kurz, Axel Kohnert: Integral point sets over Z_n^m. - (Vortrag), Veranstaltung: Optimal Discrete Structures and Algorithms (ODSA) 2006, 04.-06.09.2006, Rostock, Deutschland.

2005

Dissertation

Sascha Kurz:Konstruktion und Eigenschaften ganzzahliger Punktmengen. - Bayreuth: 2005.
(Dissertation, 2005, Universität Bayreuth, Fakultät für Mathematik, Physik und Informatik)

2004

Vorträge

Sascha Kurz: On the minimum diameter of plane integral point sets. - (Vortrag), Veranstaltung: Colloquium on Combinatorics 2004, 12.-13.11.2004, Magdeburg, Deutschland.

Sonstiges

Sascha Kurz: Polyominoes with maximum convex hull. - Bayreuth, 2004.
(Diplomarbeit, 2004, Universität Bayreuth, Fakultät für Mathematik, Physik und Informatik, Lehrstuhl Mathematik II)

2003

Vorträge

Sascha Kurz: A bijection between the d-dimensional simplices with all distances in b;1,2d; and the partitions of d+1. - (Vortrag), Veranstaltung: Colloquium on Combinatorics 2003, 14.-15.11.2003, Magdeburg, Deutschland.

apl. Prof. Dr. Sascha Kurz

Fakultät für Mathematik, Physik und Informatik
Mathematisches Institut


apl. Prof. Dr. Sascha Kurz
Apl. Professor

Lehrstuhl für Wirtschaftsmathematik
Universität Bayreuth
95440 Bayreuth

Telefon: +49 (0)176 23127234
E-Mail: sascha.kurz@uni-bayreuth.de
Google Scholar: Profil
ORCID: Profil
ResearchGate: Profil

Semantic Scholar: Profil

Büro: FAN D 1.31

Verantwortlich für die Redaktion: Tobias Kreisel

Facebook Twitter Youtube-Kanal Instagram LinkedIn Blog UBT-A Kontakt