The following pages link to Andreas Darmann (Q296976):
Displaying 31 items.
- The Subset Sum game (Q296979) (← links)
- Maximizing Nash product social welfare in allocating indivisible goods (Q320030) (← links)
- It is difficult to tell if there is a Condorcet spanning tree (Q328521) (← links)
- How hard is it to tell which is a Condorcet committee? (Q459394) (← links)
- Resource allocation with time intervals (Q606987) (← links)
- Paths, trees and matchings under disjunctive constraints (Q643009) (← links)
- Proportional Borda allocations (Q682476) (← links)
- On the shortest path game (Q729795) (← links)
- Maximizing the minimum voter satisfaction on spanning trees (Q732928) (← links)
- A note on maximizing the minimum voter satisfaction on spanning trees (Q991324) (← links)
- Group activity selection problem with approval preferences (Q1621725) (← links)
- A social choice approach to ordinal group activity selection (Q1642162) (← links)
- Stable and Pareto optimal group activity selection from ordinal preferences (Q1757088) (← links)
- On simplified group activity selection (Q1990308) (← links)
- Simplified group activity selection with group size constraints (Q2121462) (← links)
- On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685) (← links)
- Knapsack cost sharing (Q2254240) (← links)
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat} (Q2310754) (← links)
- Using the Borda rule for ranking sets of objects (Q2325666) (← links)
- The shortest connection game (Q2403801) (← links)
- Manipulability in a group activity selection problem (Q2417416) (← links)
- Finding socially best spanning treesî (Q2430005) (← links)
- Allocating indivisible items with minimum dissatisfaction on preference graphs (Q2695444) (← links)
- Hedonic diversity games revisited (Q2695455) (← links)
- The Shortest Path Game: Complexity and Algorithms (Q3190149) (← links)
- Group Activity Selection from Ordinal Preferences (Q3449521) (← links)
- Determining a Minimum Spanning Tree with Disjunctive Constraints (Q3645334) (← links)
- The Monotone Satisfiability Problem with Bounded Variable Appearances (Q4963262) (← links)
- POPULAR SPANNING TREES (Q5404516) (← links)
- Allocation of indivisible items with individual preference graphs (Q6157417) (← links)
- Stability and welfare in (dichotomous) hedonic diversity games (Q6185603) (← links)