Access Statistics for Christian Klamler

Author contact details at EconPapers.

Working Paper	File Downloads				Abstract Views
Working Paper	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	1	24	0	5	13	98
Consensus in the 2015 Provincial Parliament Election in Styria, Austria: Voting Rules,Outcomes, and the Condorcet Paradox	0	0	0	23	0	2	3	57
Divide-and-conquer: A proportional, minimal-envy cake-cutting algorithm	0	0	0	25	0	4	6	254
How to divide things fairly	0	0	0	50	1	7	7	144
Maximin Envy-Free Division of Indivisible Items	0	0	0	58	0	4	8	62
N-Person cake-cutting: there may be no perfect division	0	0	0	46	3	13	14	104
The undercut procedure: an algorithm for the envy-free division of indivisible items	0	0	0	44	2	7	14	195
Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm	0	1	1	62	1	8	11	202
Total Working Papers	0	1	2	332	7	50	76	1,116

Journal Article	File Downloads				Abstract Views
Journal Article	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	1	38	0	4	10	122
A distance measure for choice functions	0	0	0	40	0	4	5	115
A distance-based comparison of basic voting rules	0	0	0	11	0	0	1	67
A note on evaluating freedom of opinion	0	1	3	22	1	4	7	75
A note on maximizing the minimum voter satisfaction on spanning trees	0	0	0	1	0	3	6	33
A simple ultrafilter proof for an impossibility theorem in judgment aggregation	0	0	1	52	1	14	19	209
An equity-efficiency trade-off in a geometric approach to committee selection	0	0	0	6	0	2	6	47
Antipodality in committee selection	0	0	0	3	1	8	10	30
Borda and Condorcet: Some Distance Results	0	0	0	49	0	3	8	202
Committee selection under weight constraints	0	0	0	8	0	3	4	39
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	6	1	3	9	43
Evaluative voting or classical voting rules: Does it make a difference? Empirical evidence for consensus among voting rules	0	0	0	10	0	5	11	63
Finding socially best spanning trees	0	0	0	10	0	0	0	47
How risky is it to manipulate a scoring rule under incomplete information?	0	0	3	21	1	3	8	60
Kemeny's rule and Slater''s rule: A binary comparison	0	0	0	16	5	7	12	131
Knapsack cost sharing	0	0	1	9	0	1	5	66
Maximin Envy-Free Division of Indivisible Items	0	0	0	5	0	1	2	39
Maximizing the minimum voter satisfaction on spanning trees	0	0	0	5	0	5	9	47
On the Closeness Aspect of Three Voting Rules: Borda – Copeland – Maximin	0	0	1	6	0	4	9	28
Proportional Borda allocations	0	0	0	0	0	4	8	25
Proportional pie-cutting	0	0	0	30	0	7	12	159
Sharing the Cost of a Path	1	1	1	4	1	7	10	30
The Copeland rule and Condorcet’s principle	0	0	0	157	0	7	15	743
The Dodgson ranking and its relation to Kemeny’s method and Slater’s rule	0	0	0	49	0	4	5	178
The Dodgson ranking and the Borda count: a binary comparison	0	0	0	59	1	3	6	217
The traveling group problem	0	0	0	31	0	3	5	126
The undercut procedure: an algorithm for the envy-free division of indivisible items	0	0	0	10	4	7	8	63
Transitive closure, proximity and intransitivities	0	0	0	22	0	4	5	164
Using the Borda rule for ranking sets of objects	0	0	0	5	0	2	4	17
Total Journal Articles	1	2	12	685	16	122	219	3,185

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.

Authors with no registered papers

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

LogEc 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

Since October 2025, abstract view statistics are potentially heavily influenced by traffic from AI bots and tools that we could not eliminate despite our best efforts.

Statistics updated 2026-03-04