|
|
|
Proceedings
Proceedings were not published formally but were distributed
as a bound volume and are now available
as a PDF. Individual papers can also be downloaded on their
own - Here is the list from
which you can select individual papers.
Individual papers may also be accessed directly
via the program page.
The copyright for all papers lies with the individual authors.
Photos
COMSOC photos;
A very nice and complete set, I thank Ji Ruan for taking these photos.
Slides
- tutorial by Ulle Endriss (Sept 2nd)
- tutorial by Jörg Rothe (Sept 2nd)
- Christian List
tutorial (not the slides, a PDF overview of the topic)
- Ranking, Trust, and Recommendation Systems: An
Axiomatic Approach (invited talk) by Moshe Tennenholtz (Sept 3rd)
- On the Complexity of Rationalizing
Behavior, Jose Apesteguia
- Computing Spanning Trees in a Social Choice
Context, Andreas Darmann
- Approval-rating systems that never reward
insincerity, Rob LeGrand
- Aggregating Referee Scores: an Algebraic
Approach, Rolf Haenni
- Computing Kemeny Rankings, Parameterized by the
Average KT-Distance, Nadja Betzler
- Preference Functions That Score Rankings and
Maximum Likelihood Estimation (or in PPT),
Vincent Conitzer
- Lorenz rankings of rules for the adjudication of conflicting claims
William L. Thomson
- Equilibria in Social Belief Removal,
Richard Booth
- Confluence Operators: Negotiation as Pointwise Merging,
Sébastien Konieczny
- Lull and Copeland Voting Computationally resist Bribery
and Control, Jörg Rothe
- Sincere-Strategy Preference-Based Approval Voting
Fully Resists Constructive Control and Broadly Resists Destructive Control,
Gábor Erdélyi
- Approximability of Manipulating Elections,
Piotr Faliszewski
- Complexity of Unweighted Coalitional Manipulation Under
Some Common Voting Rules, Lirong Xia
- Expressiveness in mechanisms and its
relation to efficiency: Our experience
from $40 billion of combinatorial multi-attribute auctions and recent theory
(invited talk), Tuomas Sandholm
- A Qualitative Vickrey Auction,
Mathijs de Weerdt
- The Cost and Windfall of Manipulability,
Tuomas Sandholm
- On the Agenda Control Problem for Knockout
Tournaments, Thuc Vu
- How to Rig Elections and Competitions,
Noam Hazon
- On Voting Caterpillars: Approximating Maximum
Degree in a Tournament by Binary Trees
Ariel Procaccia
- A Computational Analysis of the Tournament
Equilibrium Set, Paul Harrenstein
- Individual and group strategy proofness of voting
rules. The case for restricted domains. (invited talk), Salvador Barberà
- Coalitional Manipulation Under Reasonable Assumptions,
Arkadii Slinko
- Computing the Degree of Manipulability in the
Case of Multiple Choice, Daniel Karabekyan
- Majority voting on restricted domains: a summary
Franz Dietrich and Christian List
- A geometric approach to judgment aggregation,
Christian Klamler
- From Preferences to Judgments and Back,
Davide Grossi
- Judgment Aggregation as Maximization of Epistemic
and Social Utility, Szymon Klarman
- Talk, Cheap Talk, and States of Knowledge
(invited talk), Rohit Parikh
- A Deontic Logic for Socially Optimal Norms,
Paolo Turrini
- Welfare properties of argumentation-based
semantics, Kate Larson
- Dodgson's Rule: Approximations and
Absurdity, John McCabe-Dansted
- On informational requirements of social choice rules,
Shin Sato
- Compiling the votes of a subelectorate,
Yann Chevaleyre
- Alternatives to Truthfulness are Hard to
Recognize, Carmine Ventre
- Comparing players in simple games,
Haris Aziz
- Coalition Structures in Weighted Voting Games,
Georgios Chalkiadakis
- Manipulation and Control in Weighted Voting
Games, Edith Elkind.
- Computing the Nucleolus of Weighted Voting
Games, Dmitrii Pasechnik
- A fair payoff distribution for myopic rational
agents, Stéphane Airiau
- Three-sided stable matchings with cyclic preferences
and the kidney exchange problem, Peter Biro
|