The following pages link to Christian Klamler (Q449042):
Displaying 28 items.
- Committee selection under weight constraints (Q449043) (← links)
- Proportional Borda allocations (Q682476) (← links)
- Maximizing the minimum voter satisfaction on spanning trees (Q732928) (← links)
- A distance-based comparison of basic voting rules (Q882604) (← links)
- A note on maximizing the minimum voter satisfaction on spanning trees (Q991324) (← links)
- Transitive closure, proximity and intransitivities (Q1422245) (← links)
- The Dodgson ranking and its relation to Kemeny's method and Slater's rule (Q1767291) (← links)
- The Dodgson ranking and the Borda count: a binary comparison (Q1887443) (← links)
- Two-person fair division of indivisible items when envy-freeness is impossible (Q2120143) (← links)
- Knapsack cost sharing (Q2254240) (← links)
- Using the Borda rule for ranking sets of objects (Q2325666) (← links)
- The traveling group problem (Q2385125) (← links)
- A distance measure for choice functions (Q2426961) (← links)
- Finding socially best spanning treesî (Q2430005) (← links)
- The undercut procedure: an algorithm for the envy-free division of indivisible items (Q2450092) (← links)
- Proportional pie-cutting (Q2482667) (← links)
- Condorcet efficiency, information costs, and the performance of scoring rules (Q2493269) (← links)
- Borda and condorcet: Some distance results (Q2502393) (← links)
- The Copeland rule and Condorcet's principle (Q2503435) (← links)
- Two-person fair division of indivisible items: an efficient envy-free algorithm (Q2813239) (← links)
- How to Divide Things Fairly (Q2956577) (← links)
- Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm (Q3115855) (← links)
- A Geometric Approach to Paradoxes of Majority Voting in Abstract Aggregation Theory (Q3645300) (← links)
- Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals (Q3645303) (← links)
- A Geometric Approach to Paradoxes of Majority Voting: From Anscombe’s Paradox to the Discursive Dilemma with Saari and Nurmi (Q4644770) (← links)
- <em>N</em>-Person Cake-Cutting: There May Be No Perfect Division (Q4923957) (← links)
- Fair Division (Q5150295) (← links)
- (Q5450059) (← links)
