Forschung

Journal Publications

  • Andreas Darmann. "Stability and Welfare in (Dichotomous) Hedonic Diversity Games", Theory of Computing Systems, 67:1133-1155, 2023.
  • Andreas Darmann, Christian Klamler. "Does the Rule Matter? A Comparison of Preference Elicitation Methods and Voting Rules Based on Data from an Austrian Regional Parliamentary Election in 2019", Public Choice, 197:63-87,2023.
  • Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Ulrich Pferschy, and Nevena Pivač. "Allocation of Indivisible Items with Individual Preference Graphs", Discrete Applied Mathematics, 334:45-62, 2023.
  • Andreas Darmann, Janosch Döcker, Britta Dorn, and Sebastian Schneckenburger. "Simplified Group Activity Selection with Group Size Constraints", International Journal of Game Theory, 51:169-212, 2022.
  • Andreas Darmann and Janosch Döcker. "On simplified NP-complete variants of Monotone 3-SAT", Discrete Applied Mathematics, 292:45-58, 2021.
  • Andreas Darmann and Janosch Döcker. "On a simple hard variant of Not-All-Equal 3-SAT", Theoretical Computer Science, 815:147-152, 2020.
  • Andreas Darmann and Christian Klamler. "Using the Borda rule for ranking sets of objects", Social Choice and Welfare, 53(3):399-414, 2019.
  • Andreas Darmann, Julia Grundner, and Christian Klamler. "Evaluative voting or classical voting rules: Does it make a difference? Empirical evidence for consensus among voting rules", European Journal of Political Economy, 59:345-353, 2019.
  • Andreas Darmann. "Manipulability in a group activity selection problem", Social Choice and Welfare, 52(3):527-557, 2019.
  • Andreas Darmann. "Stable and Pareto optimal group activity selection from ordinal preferences", International Journal of Game Theory, 47(4):1183-1209, 2018.
  • Andreas Darmann. "A social choice approach to ordinal group activity selection", Mathematical Social Sciences, 93:57–66, 2018.
  • Andreas Darmann, Janosch Doecker, and Britta Dorn. "The monotone satisfiability problem with bounded variable appearances", International Journal of Foundations of Computer Science, 29(6):979-993, 2018.
  • Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, and Gerhard Woeginger. "Group activity selection problem with approval preferences", International Journal of Game Theory, 47(3):767–796, 2018.
  • Andreas Darmann, Julia Grundner, and Christian Klamler. "Election outcomes under different ways to announce preferences: an analysis of the 2015 parliament election in the Austrian federal state of Styria", Public Choice, 173(1):201–216, 2017.
  • Andreas Darmann, Ulrich Pferschy, and Joachim Schauer. "The shortest connection game", Discrete Applied Mathematics, 231:139–154, 2017.
  • Andreas Darmann, Ulrich Pferschy, and Joachim Schauer. "On the shortest path game", Discrete Applied Mathematics, 217(1):3–18, 2017.
  • Andreas Darmann. "It is difficult to tell if there is a Condorcet spanning tree", Mathematical Methods of Operations Research, 84:93–104, 2016.
  • Andreas Darmann and Christian Klamler. "Proportional Borda allocations", Social Choice and Welfare, 47(3):543–558, 2016.
  • Andreas Darmann and Joachim Schauer. "Maximizing Nash product social welfare in allocating indivisible goods", European Journal of Operational Research, 247(2):548–559, 2015.
  • Andreas Darmann, Christian Klamler, and Ulrich Pferschy. "Sharing the cost of a path", Studies in Microeconomics, 3(1):1–12, 2015.
  • Andreas Darmann, Gaia Nicosia, Ulrich Pferschy, and Joachim Schauer. "The subset sum game", European Journal of Operational Research, 233(3):539–549, 2014.
  • Andreas Darmann and Christian Klamler. "Knapsack cost sharing", Review of Economic Design, 18(3):219–241, 2014.
  • Andreas Darmann. "It is hard to agree on a spanning tree", Economics Bulletin, 34(1):34–40, 2014.
  • Andreas Darmann. "Popular spanning trees", International Journal of Foundations of Computer Science, 24(5):655–677, 2013.
  • Andreas Darmann. "How hard is it to tell which is a Condorcet committee", Mathematical Social Sciences, 66(3):282–292, 2013.
  • Andreas Darmann, Ulrich Pferschy, Joachim Schauer, and Gerhard J. Woeginger. "Paths, trees and matchings under disjunctive constraints", Discrete Applied Mathematics, 159(16):1726–1735, 2011.
  • Andreas Darmann, Christian Klamler, and Ulrich Pferschy. "Finding socially best spanning trees", Theory and Decision, 70(4):511–527, 2011.
  • Andreas Darmann, Ulrich Pferschy, and Joachim Schauer. "Resource allocation with time intervals", Theoretical Computer Science, 411(49):4217–4234, 2010.
  • Andreas Darmann, Christian Klamler, and Ulrich Pferschy. "A note on maximizing the minimum voter satisfaction on spanning trees", Mathematical Social Sciences, 60(1):82–85, 2010.
  • Andreas Darmann, Christian Klamler, and Ulrich Pferschy. "Maximizing the minimum voter satisfaction on spanning trees", Mathematical Social Sciences, 58(2):238–250, 2009.

Article in Book

  • Andreas Darmann and Jérôme Lang. "Group activity selection problems". In U. Endriss (editor), Trends in Computational Social Choice, pages 385–410. AI Access, 2017.
Priv.-Doz. Mag. Dipl.-Ing. Dr.

Andreas Darmann

Priv.-Doz. Mag. Dipl.-Ing. Dr. Andreas Darmann Institut für Finanzwissenschaft und Öffentliche Wirtschaft
+43 316 380 - 7139