The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
A Short Introduction to Computational Social Choice
Open accessAbstract
Computational social choice is an interdisciplinary field of study at the interface of social choice theory and computer science, promoting an exchange of ideas in both directions. On the one hand, it is concerned with the application of techniques developed in computer science, such as complexity analysis or algorithm design, to the study of social choice mechanisms, such as voting procedures or fair division algorithms. On the other hand, computational social choice is concerned with importing concepts from social choice theory into computing. For instance, the study of preference aggregation mechanisms is also very relevant to multiagent systems. In this short paper we give a general introduction to computational social choice, by proposing a taxonomy of the issues addressed by this discipline, together with some illustrative examples and an (incomplete) bibliography.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Social Choice and Individual Values.
Shackle, G. L. S., & Arrow, K. J. (1951) · Economica · doi:10.2307/2549613 · Cited by 7,792
(1994) · Cited by 5,513
Social Choice and Individual Values
Baumol, W. J., & Arrow, K. J. (1952) · Econometrica · doi:10.2307/1907815 · Cited by 4,699
Manipulation of Voting Schemes: A General Result
Gibbard, A. (1973) · Econometrica · doi:10.2307/1914083 · Cited by 3,202
Satterthwaite, M. A. (1975) · Journal of Economic Theory · doi:10.1016/0022-0531(75)90050-2 · Cited by 2,821
(2005) · Complexity Theory · doi:10.1007/3-540-27477-4_15 · Cited by 1,629
Harel, D., Kozen, D. C., & Tiuryn, J. (2000) · Cited by 1,439
Axioms of Cooperative Decision Making
Moulin, H. (1988) · doi:10.1017/ccol0521360552 · Cited by 1,279
Computationally Manageable Combinational Auctions
Rothkopf, M. H., Pekeč, A., & Harstad, R. M. (1998) · Management Science · doi:10.1287/mnsc.44.8.1131 · Cited by 1,024
(2014) · A Primer on Auction Design, Management, and Strategy · doi:10.7551/mitpress/8637.003.0011 · Cited by 923
Cited by
Explanation in artificial intelligence: Insights from the social sciences
Miller, T. (2019) · Artificial Intelligence · doi:10.1016/j.artint.2018.07.007 · Cited by 5,302
Algorithmics of Matching Under Preferences
Manlove, D. F. (2013) · Series on Theoretical Computer Science · doi:10.1142/8591 · Cited by 515
Open Problems in Cooperative AI
Dafoe, A., Hughes, E., Bachrach, Y., Collins, T., McKee, K. R., Leibo, J. Z., Larson, K., & Graepel, T. (2020) · arXiv · doi:10.48550/arxiv.2012.08630 · Cited by 93
Metadata
- Authors
- Chevaleyre, Y., Endriss, U., Lang, J., & Maudet, N.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007
- Pages
- 51-69
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2107392942
- Cited by
- 261
- References
- 49
- FWCI
- 67.32
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Short Introduction to Computational Social Choice. https://app.cochat.ai/papers/10.1007/978-3-540-69507-3_4
- The paper
- Chevaleyre, Y., Endriss, U., Lang, J., & Maudet, N. (2007). A Short Introduction to Computational Social Choice. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-69507-3_4
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.