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 1 2 19 0 5 12 72
Consensus in the 2015 Provincial Parliament Election in Styria, Austria: Voting Rules,Outcomes, and the Condorcet Paradox 0 0 0 18 1 1 8 39
Divide-and-conquer: A proportional, minimal-envy cake-cutting algorithm 0 1 3 24 0 1 8 236
How to divide things fairly 0 0 2 41 0 1 9 72
Maximin Envy-Free Division of Indivisible Items 0 0 1 57 0 2 6 43
N-Person cake-cutting: there may be no perfect division 0 0 1 46 1 1 11 90
The undercut procedure: an algorithm for the envy-free division of indivisible items 0 0 2 43 1 2 8 171
Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm 0 0 1 59 1 3 16 177
Total Working Papers 0 2 12 307 4 16 78 900


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 4 31 2 2 11 85
A distance measure for choice functions 0 0 0 35 0 1 5 100
A distance-based comparison of basic voting rules 0 0 0 11 0 0 2 63
A note on evaluating freedom of opinion 0 0 0 16 0 1 5 51
A note on maximizing the minimum voter satisfaction on spanning trees 0 0 0 1 0 0 1 25
A simple ultrafilter proof for an impossibility theorem in judgment aggregation 0 0 1 44 1 2 10 178
An equity-efficiency trade-off in a geometric approach to committee selection 0 0 0 6 0 0 1 34
Antipodality in committee selection 0 0 1 2 0 0 4 18
Borda and Condorcet: Some Distance Results 0 0 0 49 0 1 4 189
Committee selection under weight constraints 0 0 1 6 0 0 2 26
Election outcomes under different ways to announce preferences: an analysis of the 2015 parliament election in the Austrian federal state of Styria 0 0 2 3 2 3 8 22
Evaluative voting or classical voting rules: Does it make a difference? Empirical evidence for consensus among voting rules 1 1 4 5 2 6 18 23
Finding socially best spanning trees 0 0 0 10 1 1 2 42
How risky is it to manipulate a scoring rule under incomplete information? 0 0 0 17 0 0 1 37
Kemeny's rule and Slater''s rule: A binary comparison 0 0 0 13 2 4 21 94
Knapsack cost sharing 0 0 1 5 0 2 15 47
Maximin Envy-Free Division of Indivisible Items 0 0 2 5 0 2 13 25
Maximizing the minimum voter satisfaction on spanning trees 0 0 0 3 1 1 4 34
On the Closeness Aspect of Three Voting Rules: Borda – Copeland – Maximin 1 2 2 3 2 4 8 10
Proportional Borda allocations 0 0 0 0 2 3 6 10
Proportional pie-cutting 0 0 0 30 1 1 2 123
Sharing the Cost of a Path 0 0 0 2 0 1 1 16
The Copeland rule and Condorcet’s principle 0 0 0 150 1 2 4 701
The Dodgson ranking and its relation to Kemeny’s method and Slater’s rule 1 1 1 49 1 1 3 167
The Dodgson ranking and the Borda count: a binary comparison 0 0 1 56 0 0 1 205
The traveling group problem 0 0 2 31 0 0 7 119
The undercut procedure: an algorithm for the envy-free division of indivisible items 0 0 0 8 1 3 8 44
Transitive closure, proximity and intransitivities 0 0 0 21 0 0 2 154
Using the Borda rule for ranking sets of objects 0 0 3 3 0 0 4 7
Total Journal Articles 3 4 25 615 19 41 173 2,649


Statistics updated 2021-01-03