2006 · 2008 · 2010 · 2012 · 2014 · 2016 · 2018 · 2021 · 2023
These are the proceedings of COMSOC-2006, an event that is part of the COMSOC Workshop Series.
The papers are ordered by last name of the authors.
Towards a Logic of Social Welfare
Thomas Ågotnes,
Wiebe van der Hoek and
Michael Wooldridge
[PDF File]
A Generic Approach to Coalition Formation
Krzysztof Apt and
Andreas Witzel
[PDF File]
Welfarism and the Assessments of Social Decision Rules
Claus Beisbart and
Stephan Hartmann
[PDF File]
Finding Leximin-Optimal Solutions using Constraint Programming
Sylvain Bouveret and
Michel Lemaître
[PDF File]
The Computational Complexity of Choice Sets
Felix Brandt,
Felix Fischer and
Paul Harrenstein
[PDF File]
Natural Rules for Optimal Debates: Preliminaries for a Combinatorial Exploration
Yann Chevaleyre and
Nicolas Maudet
[PDF File]
On Complexity of Lobbying in Multiple Referenda
Robin Christian,
Mike Fellows,
Frances Rosamond and
Arkadii Slinko
[PDF File]
Eliciting Single-Peaked Preferences using Comparison Queries
Vincent Conitzer
[PDF File]
How to Allocate Hard Candies Fairly
Marco Dall'Aglio and
Raffaele Mosca
[PDF File]
Social Choice and the Logic of Simple Games
Tijmen Daniëls
[PDF File]
Judgment Aggregation without Full Rationality
Franz Dietrich and
Christian List
[PDF File]
The Probability of Sen's Liberal Paradox
Keith Dougherty and
Julian Edward
[PDF File]
The Discursive Dilemma as a Lottery Paradox
Igor Douven and
Jan-Willem Romeijn
[PDF File]
Hybrid Voting Protocols and Hardness of Manipulation
Edith Elkind and
Helger Lipmaa
[PDF File]
The Complexity of Bribery in Elections
Piotr Faliszewski,
Edith Hemaspaandra and
Lane Hemaspaandra
[PDF File]
Optimizing Streaming Applications with Self-Interested Users using M-DPOP
Boi Faltings,
David Parkes,
Adrian Petcu and
Jeff Shneidman
[PDF File]
QuickRank: A Recursive Ranking Algorithm
Amy Greenwald and
John Wicks
[PDF File]
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
Edith Hemaspaandra,
Lane Hemaspaandra and
Jörg Rothe
[PDF File]
Decentralization and Mechanism Design for Online Machine Scheduling
Birgit Heydenreich,
Rudolf Müller and
Marc Uetz
[PDF File]
Guarantees for the Success Frequency of an Algorithm for Finding Dodgson Winners
Christopher Homan and
Lane A. Hemaspaandra
[PDF File]
Approval Voting: Local Search Heuristics and Approximation Algorithms for the Minimax Solution
Rob LeGrand,
Evangelos Markakis and
Aranyak Mehta
[PDF File]
Equal Representation in Two-tier Voting Systems
Nicola Maaser and
Stefan Napel
[PDF File]
The Distributed Negotiation of Egalitarian Allocations
Paul-Amaury Matt,
Francesca Toni and
Dionysis Dionysiou
[PDF File]
Anonymous Voting and Minimal Manipulability
Stefan Maus,
Hans Peters and
Ton Storcken
[PDF File]
Approximability of Dodgson's Rule
John Christopher McCabe-Dansted,
Geoffrey Pritchard and
Arkadii Slinko
[PDF File]
Simulating the Effects of Misperception on the Manipulability of Voting
Johann Mitlöhner,
Daniel Eckert and
Christian Klamler
[PDF File]
Weak Monotonicity and Bayes-Nash Incentive Compatibility
Rudolf Müller,
Andrés Perea and
Sascha Wolf
[PDF File]
Voting Systems and Automated Reasoning: The QBFEVAL Case Study
Massimo Narizzano,
Luca Pulina and
Armando Tacchella
[PDF File]
Bicriteria Models for Fair Resource Allocation
Wlodzimierz Ogryczak
[PDF File]
Some Results on Adjusted Winner
Eric Pacuit,
Rohit Parikh and
Samer Salame
[PDF File]
Merging Judgments and the Problem of Truth-Tracking
Gabriella Pigozzi and
Stephan Hartmann
[PDF File]
On the Robustness of Preference Aggregation in Noisy Environments
Ariel Procaccia,
Jeffrey Rosenschein and
Gal Kaminka
[PDF File]
Automated Design of Voting Rules by Learning from Examples
Ariel Procaccia,
Aviv Zohar and
Jeffrey Rosenschein
[PDF File]
Retrieving the Structure of Utility Graphs used in Multi-Item Negotiation through Collaborative Filtering
Valentin Robu and
Han La Poutré
[PDF File]
On Determining Dodgson Winners by Frequently Self-Knowingly Correct Algorithms and in Average-Case Polynomial Time
Jörg Rothe and
Holger Spakowski
[PDF File]
Voting Cycles in a Computational Electoral Competition Model with Endogenous Interest Groups
Vjollca Sadiraj,
Jan Tuinstra and
Frans van Winden
[PDF File]
Domains of Social Choice Functions on which Coalition Strategy-Proofness and Maskin Monotonicity are Equivalent
Koji Takamiya
[PDF File]
Small Binary Voting Trees
Michael Trick
[PDF File]