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 0 23 0 0 2 85
Consensus in the 2015 Provincial Parliament Election in Styria, Austria: Voting Rules,Outcomes, and the Condorcet Paradox 0 0 1 23 1 1 4 54
Divide-and-conquer: A proportional, minimal-envy cake-cutting algorithm 0 0 0 25 0 0 0 248
How to divide things fairly 0 0 0 50 2 2 3 137
Maximin Envy-Free Division of Indivisible Items 0 0 0 58 0 1 4 54
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 3 181
Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm 0 0 0 61 0 1 1 191
Total Working Papers 0 0 1 330 3 6 17 1,040

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 3 37 1 2 10 112
A distance measure for choice functions 0 0 0 40 1 1 1 110
A distance-based comparison of basic voting rules 0 0 0 11 0 0 1 66
A note on evaluating freedom of opinion 0 0 1 19 0 0 2 68
A note on maximizing the minimum voter satisfaction on spanning trees 0 0 0 1 0 1 2 27
A simple ultrafilter proof for an impossibility theorem in judgment aggregation 1 1 1 51 1 1 2 190
An equity-efficiency trade-off in a geometric approach to committee selection 0 0 0 6 0 0 2 41
Antipodality in committee selection 0 0 0 3 0 0 0 20
Borda and Condorcet: Some Distance Results 0 0 0 49 1 1 1 194
Committee selection under weight constraints 0 0 0 8 0 1 3 35
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 5 0 0 2 34
Evaluative voting or classical voting rules: Does it make a difference? Empirical evidence for consensus among voting rules 0 1 2 10 0 1 5 52
Finding socially best spanning trees 0 0 0 10 1 1 1 47
How risky is it to manipulate a scoring rule under incomplete information? 0 0 0 18 2 2 3 52
Kemeny's rule and Slater''s rule: A binary comparison 0 0 2 16 0 0 3 119
Knapsack cost sharing 0 0 0 8 0 0 2 61
Maximin Envy-Free Division of Indivisible Items 0 0 0 5 0 1 3 37
Maximizing the minimum voter satisfaction on spanning trees 0 0 1 5 1 2 3 38
On the Closeness Aspect of Three Voting Rules: Borda – Copeland – Maximin 0 1 1 5 1 2 2 19
Proportional Borda allocations 0 0 0 0 0 1 2 17
Proportional pie-cutting 0 0 0 30 1 3 10 147
Sharing the Cost of a Path 0 0 0 3 1 2 2 20
The Copeland rule and Condorcet’s principle 1 1 2 157 2 2 3 728
The Dodgson ranking and its relation to Kemeny’s method and Slater’s rule 0 0 0 49 0 1 1 173
The Dodgson ranking and the Borda count: a binary comparison 0 0 0 59 0 0 0 211
The traveling group problem 0 0 0 31 1 2 2 121
The undercut procedure: an algorithm for the envy-free division of indivisible items 0 0 0 10 0 0 1 55
Transitive closure, proximity and intransitivities 0 0 0 22 1 1 1 159
Using the Borda rule for ranking sets of objects 0 0 1 5 0 1 2 13
Total Journal Articles 2 4 15 673 15 29 72 2,966

logo

LogEc Home

Top Working Papers
Top Journal Articles
Top Books
Top Chapters
Top Software Items

Top Authors

Top Working Paper series and Journals

About LogEc

Authors with papers registered in the RePEc Author Service.

Register yourself as an author or register more papers in the RePEc Author Service.

Authors with no registered papers

RePEc
LogEc provides access and usage for services based on the RePEc data set.

Örebro UniversityLogEc is hosted by the Örebro University School of Business.

Questions or comments? Please see our explanation of how the statistics are collected or e-mail

Statistics updated 2025-03-03