Access Statistics for Christian Klamler

Author contact details at EconPapers.

Working Paper File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
An algorithm for the proportional division of indivisible items 0 0 2 22 0 1 3 82
Consensus in the 2015 Provincial Parliament Election in Styria, Austria: Voting Rules,Outcomes, and the Condorcet Paradox 0 0 2 22 0 1 4 50
Divide-and-conquer: A proportional, minimal-envy cake-cutting algorithm 0 0 0 25 0 0 3 247
How to divide things fairly 0 1 2 50 0 2 13 125
Maximin Envy-Free Division of Indivisible Items 0 0 0 57 0 0 1 48
N-Person cake-cutting: there may be no perfect division 0 0 0 46 0 0 0 90
The undercut procedure: an algorithm for the envy-free division of indivisible items 0 0 0 44 0 1 1 178
Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm 0 0 0 59 0 0 2 187
Total Working Papers 0 1 6 325 0 5 27 1,007


Journal Article File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A comparison of the Dodgson method and the Copeland rule 0 0 0 33 2 3 5 98
A distance measure for choice functions 0 0 2 40 0 0 3 109
A distance-based comparison of basic voting rules 0 0 0 11 0 0 0 65
A note on evaluating freedom of opinion 0 0 1 18 0 0 1 66
A note on maximizing the minimum voter satisfaction on spanning trees 0 0 0 1 0 0 0 25
A simple ultrafilter proof for an impossibility theorem in judgment aggregation 0 0 3 50 0 0 4 188
An equity-efficiency trade-off in a geometric approach to committee selection 0 0 0 6 0 0 0 38
Antipodality in committee selection 0 0 1 3 0 0 1 20
Borda and Condorcet: Some Distance Results 0 0 0 49 0 0 2 193
Committee selection under weight constraints 0 1 1 8 0 1 1 31
Election outcomes under different ways to announce preferences: an analysis of the 2015 parliament election in the Austrian federal state of Styria 0 0 1 4 1 1 2 31
Evaluative voting or classical voting rules: Does it make a difference? Empirical evidence for consensus among voting rules 0 0 0 7 1 1 5 42
Finding socially best spanning trees 0 0 0 10 0 0 0 45
How risky is it to manipulate a scoring rule under incomplete information? 0 0 1 18 0 0 1 48
Kemeny's rule and Slater''s rule: A binary comparison 0 0 1 14 0 1 3 115
Knapsack cost sharing 1 1 1 6 1 1 2 55
Maximin Envy-Free Division of Indivisible Items 0 0 0 5 1 1 2 30
Maximizing the minimum voter satisfaction on spanning trees 0 0 0 4 0 0 0 35
On the Closeness Aspect of Three Voting Rules: Borda – Copeland – Maximin 0 0 0 4 0 0 0 13
Proportional Borda allocations 0 0 0 0 1 1 1 15
Proportional pie-cutting 0 0 0 30 0 0 1 137
Sharing the Cost of a Path 0 0 0 3 0 0 0 18
The Copeland rule and Condorcet’s principle 0 0 0 155 0 2 5 725
The Dodgson ranking and its relation to Kemeny’s method and Slater’s rule 0 0 0 49 1 1 2 171
The Dodgson ranking and the Borda count: a binary comparison 0 0 2 58 0 0 4 210
The traveling group problem 0 0 0 31 0 0 0 119
The undercut procedure: an algorithm for the envy-free division of indivisible items 0 0 0 9 0 0 1 52
Transitive closure, proximity and intransitivities 0 0 0 22 0 0 1 158
Using the Borda rule for ranking sets of objects 0 0 0 4 1 1 1 10
Total Journal Articles 1 2 14 652 9 14 48 2,862


Statistics updated 2023-05-07