default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Klamler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j15]Steven J. Brams, D. Marc Kilgour
, Christian Klamler:
Two-Person Fair Division of Indivisible Items when Envy-Freeness is Impossible. Oper. Res. Forum 3(2) (2022)
2010 – 2019
- 2019
- [j14]Andreas Darmann, Christian Klamler:
Using the Borda rule for ranking sets of objects. Soc. Choice Welf. 53(3): 399-414 (2019) - 2016
- [j13]Andreas Darmann, Christian Klamler:
Proportional Borda allocations. Soc. Choice Welf. 47(3): 543-558 (2016) - 2013
- [j12]Steven J. Brams, Michael A. Jones, Christian Klamler:
N-Person Cake-Cutting: There May Be No Perfect Division. Am. Math. Mon. 120(1): 35-47 (2013) - 2012
- [j11]Christian Klamler, Ulrich Pferschy, Stefan Ruzika:
Committee selection under weight constraints. Math. Soc. Sci. 64(1): 48-56 (2012) - [j10]Steven J. Brams, D. Marc Kilgour, Christian Klamler:
The undercut procedure: an algorithm for the envy-free division of indivisible items. Soc. Choice Welf. 39(2-3): 615-631 (2012) - [i3]Edith Elkind, Christian Klamler, Jeffrey S. Rosenschein, M. Remzi Sanver:
Computation and Incentives in Social Choice (Dagstuhl Seminar 12101). Dagstuhl Reports 2(3): 1-22 (2012) - 2011
- [j9]Steven J. Brams, Michael A. Jones, Christian Klamler:
Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm. SIAM Rev. 53(2): 291-307 (2011) - [p2]Daniel Eckert, Christian Klamler:
Distance-Based Aggregation Theory. Consensual Processes 2011: 3-22 - 2010
- [j8]Andreas Darmann, Christian Klamler, Ulrich Pferschy:
A note on maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. 60(1): 82-85 (2010) - [p1]Christian Klamler:
Fair Division. Handbook of Group Decision and Negotiation 2010: 183-202
2000 – 2009
- 2009
- [j7]Andreas Darmann, Christian Klamler, Ulrich Pferschy:
Maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. 58(2): 238-250 (2009) - [c2]Daniel Eckert, Christian Klamler:
A Geometric Approach to Paradoxes of Majority Voting in Abstract Aggregation Theory. ADT 2009: 14-25 - [c1]Christian Klamler, Ulrich Pferschy, Stefan Ruzika:
Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals. ADT 2009: 50-61 - 2008
- [j6]Steven J. Brams, Michael A. Jones, Christian Klamler:
Proportional pie-cutting. Int. J. Game Theory 36(3-4): 353-367 (2008) - [j5]Christian Klamler:
A distance measure for choice functions. Soc. Choice Welf. 30(3): 419-425 (2008) - 2007
- [j4]Christian Klamler, Ulrich Pferschy:
The traveling group problem. Soc. Choice Welf. 29(3): 429-452 (2007) - [i2]Steven J. Brams, Michael A. Jones, Christian Klamler:
Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure. Fair Division 2007 - [i1]Steven J. Brams, Michael A. Jones, Christian Klamler:
Better Ways to Cut a Cake - Revisited. Fair Division 2007 - 2006
- [j3]Daniel Eckert, Christian Klamler, Johann Mitlöhner, Christian Schlötterer:
A distance-based comparison of basic voting rules. Central Eur. J. Oper. Res. 14(4): 377-386 (2006) - 2004
- [j2]Christian Klamler:
The Dodgson ranking and the Borda count: a binary comparison. Math. Soc. Sci. 48(1): 103-108 (2004) - [j1]Christian Klamler:
The Dodgson ranking and its relation to Kemeny's method and Slater's rule. Soc. Choice Welf. 23(1): 91-102 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
