diff --git a/comsoc-website/_collections/comsoc-2016.html b/comsoc-website/_collections/comsoc-2016.html new file mode 100644 index 0000000..9b5a5d7 --- /dev/null +++ b/comsoc-website/_collections/comsoc-2016.html @@ -0,0 +1,3 @@ +--- +permalink: archive/comsoc-2016/:title +--- \ No newline at end of file diff --git a/comsoc-website/archive/comsoc-2016/4thcomsoc.jpg b/comsoc-website/archive/comsoc-2016/4thcomsoc.jpg new file mode 100644 index 0000000..09cb02c Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/4thcomsoc.jpg differ diff --git a/comsoc-website/archive/comsoc-2016/acc.html b/comsoc-website/archive/comsoc-2016/acc.html new file mode 100644 index 0000000..27dbb4c --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/acc.html @@ -0,0 +1,211 @@ + + + +COMSOC-2016: Sixth International Workshop on Computational Social Choice + + + + + +
+ + + + +
+ +
+ Sixth International Workshop on Computational Social Choice
+ Toulouse, France, 22–24 June 2016 +
+
+ + + + + + + + + + + + + + +
+ +     + + +

Accepted Papers

+ +

The accepted papers are: + +

    +
  • Cycles and Intractability in Social Choice Theory
    + William Zwicker +
  • Pareto optimal matchings of students to courses in the presence of prerequisites
    + Katarina Cechlarova, Bettina Klaus and David Manlove +
  • Who Can Win a Single-Elimination Tournament?
    + Michael P. Kim, Warut Suksompong and Virginia Vassilevska Williams +
  • Fairness in voting: the tale of Blotto's lieutenants
    + Alessandra Casella, Jean-Francois Laslier and Antonin Macé +
  • Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving
    + Florian Brandl, Felix Brandt and Christian Geist +
  • Agenda Separability in Judgment Aggregation +
    + Jerome Lang, Marija Slavkovik and Srdjan Vesic +
  • Arguing about Voting Rules
    + Olivier Cailloux and Ulle Endriss +
  • Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
    + Ronald de Haan +
  • On Voting and Facility Location
    + Michal Feldman, Amos Fiat and Iddan Golomb +
  • Bounds on Manipulation by Merging in Weighted Voting Games
    + Ramoni Lasisi and Abibat Lasisi +
  • Strong and Weak Acyclicity in Iterative Voting
    + Reshef Meir +
  • Ordinal power relations and social rankings
    + Stefano Moretti and Meltem Ozturk +
  • Analyzing games with ambiguous types using the MINthenMAX decision model
    + Ilan Nehama + +
  • Rules for Choosing Societal Tradeoffs
    + Vincent Conitzer, Rupert Freeman, Markus Brill and Yuqian Li +
  • Condorcet Domains and Median Graphs
    + Clemens Puppe and Arkadii Slinko +
  • Fair Social Choice in Dynamic Settings
    + Rupert Freeman, Seyed Majid Zahedi and Vincent Conitzer +
  • Computing Pareto Optimal Committees
    + Haris Aziz, Jerome Lang and Jerome Monnot +
  • Altruistic Hedonic Games
    + Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jorg Rothe and Lena Schend +
  • Verification in Incomplete Argumentation Frameworks
    + Dorothea Baumeister, Daniel Neugebauer, Jorg Rothe and Hilmar Schadrack +
  • Natural Interviewing Equilibria for Stable Matching
    + Joanna Drummond, Allan Borodin and Kate Larson +
  • Strategy-Proofness of Scoring Allocation Correspondences
    + Nhan-Tam Nguyen, Dorothea Baumeister and Jorg Rothe +
  • Single-peakedness Based on the Net Preference Matrix: Characterization and Algorithms
    + Olivier Spanjaard and Paul Weng +
  • Pareto optimal matchings with lower quotas +
    + Katarina Cechlarova and Tamás Fleiner +
  • Bayesian Estimators As Voting Rules +
    + Lirong Xia +
  • The Single-Peaked Domain Revisited: A Simple Global Characterization
    + Clemens Puppe +
  • Learning Mixtures of Plackett-Luce models
    + Zhibing Zhao, Peter Piech and Lirong Xia +
  • Misrepresentation in District Voting
    + Yoram Bachrach, Omer Lev, Yoad Lewenberg and Yair Zick +
  • Divide and Conquer: Using Geographic Manipulation to Win District-Based Elections
    + Yoad Lewenberg and Omer Lev +
  • How effective can simple ordinal peer grading be?
    + Ioannis Caragiannis, George Krimpas and Alexandros Voudouris +
  • Recognising Multidimensional Euclidean Preferences
    + Dominik Peters +
  • How Hard Is It to Control a Group?
    + Yongjie Yang and Dinko Dimitrov +
  • Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences
    + Sylvain Bouveret and Michel Lemaître +
  • Truth-revealing voting rules for large populations
    + Matias Nunez and Marcus Pivato +
  • On Truthful Mechanisms for Maximin Share Allocations
    + Georgios Amanatidis, Georgios Birmpas and Evangelos Markakis +
  • Object allocation problems under constraints
    + Laurent Gourves, Carlos Martinhon and Jerome Monnot +
  • Conditional and Sequential Approval Voting on Combinatorial Domains
    + Nathanaël Barrot and Jerome Lang +
  • A Majoritarian Representative Voting System
    + Pietro Speroni di Fenizio and Daniele A. Gewurz +
  • Structure in Dichotomous Preferences
    + Edith Elkind and Martin Lackner +
  • Borda, Condorcet, and Pareto optimality in ordinal group activity selection
    + Andreas Darmann +
  • Proportional Borda Allocations
    + Andreas Darmann and Christian Klamler +
  • Majority Graphs of Assignment Problems and Properties of Popular Random Assignments
    + Felix Brandt, Johannes Hofbauer and Martin Suderland +
  • Optimal Reallocation under Additive and Ordinal Preferences
    + Haris Aziz, Peter Biro, Jerome Lang, Julien Lesca and Jerome Monnot +
  • Committee Scoring Rules
    + Piotr Faliszewski, Piotr Skowron, Arkadii Slinko and Nimrod Talmon +
  • Analyzing the Practical Relevance of Voting Paradoxes via Ehrhart Theory, Computer Simulations, and Empirical Data
    + Felix Brandt, Christian Geist and Martin Strobel +
  • The one-dimensional Euclidean preferences: Finitely many forbidden substructures are not enough
    + Jiehua Chen, Kirk Pruhs and Gerhard J. Woeginger +
  • And the winner is ... Chevalier de Borda: Neural networks vote according to Borda's Rule
    + Dávid Burka, Clemens Puppe, László Szepesváry and Attila Tasnadi +
  • Axiomatic Characterization of Committee Scoring Rules
    + Piotr Skowron, Piotr Faliszewski and Arkadii Slinko +
  • Incremental Approval Voting for Multi-agent Knapsack Problems
    + Nawal Benabbou and Patrice Perny +
  • Edge-Compressed Majority Graph: Where Social Choice Meets Information Visualization
    + Nikos Karanikolas, Renaud Blanch and Sylvain Bouveret +
  • Doodle Poll Games
    + Svetlana Obraztsova, Maria Polukarov, Zinovi Rabinovich and Edith Elkind +
  • Automated Verification for Functional and Relational Properties of Voting Rules
    + Bernhard Beckert, Thorsten Bormer, Michael Kirsten, Till Neuber and Mattias Ulbrich +
  • Complexity of Manipulative Actions When Voting with Ties
    + Zack Fitzsimmons and Edith Hemaspaandra +
  • The Random Pairs Voting Rule: Introduction and Evaluation With a Large Dataset
    + Jeremy Hansen +
  • Equilibria of Plurality Voting: Lazy and Truth-biased Voters
    + Edith Elkind, Evangelos Markakis, Svetlana Obraztsova and Piotr Skowron +
  • Refinement and randomised versions of some tournament solutions
    + Justin Kruger, Stéphane Airiau and Jérôme Lang + + + + +
      + +

      + + + +
+ + + + + + + + +
+ + +
+ + + diff --git a/comsoc-website/archive/comsoc-2016/acc3.html b/comsoc-website/archive/comsoc-2016/acc3.html new file mode 100644 index 0000000..2483807 --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/acc3.html @@ -0,0 +1,126 @@ + + + +COMSOC-2016: Sixth International Workshop on Computational Social Choice + + + + + +
+ + + + +
+ +
+ Sixth International Workshop on Computational Social Choice
+ Toulouse, France, 22–24 June 2016 +
+
+ + + + + + + + + + + + + + +
+ +     + + + +

Accepted Papers

+ +

The accepted papers are: + +

    +
  • Cycles and Intractability in Social Choice Theory
    + William Zwicker +
  • Pareto optimal matchings of students to courses in the presence of prerequisites
    + Katarina Cechlarova, Bettina Klaus and David Manlove +
  • Who Can Win a Single-Elimination Tournament?
    + Michael P. Kim, Warut Suksompong and Virginia Vassilevska Williams +
  • Fairness in voting: the tale of Blotto's lieutenants
    + Alessandra Casella, Jean-Francois Laslier and Antonin Macé +
  • Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving
    + Florian Brandl, Felix Brandt and Christian Geist +
  • Agenda Separability in Judgment Aggregation +
    + Jérôme Lang, Marija Slavkovik and Srdjan Vesic +
  • Arguing about Voting Rules
    + Olivier Cailloux and Ulle Endriss +
  • Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
    + Ronald de Haan +
  • On Voting and Facility Location
    + Michal Feldman, Amos Fiat and Iddan Golomb +
  • Bounds on Manipulation by Merging in Weighted Voting Games
    + Ramoni Lasisi and Abibat Lasisi +
  • Strong and Weak Acyclicity in Iterative Voting
    + Reshef Meir +
  • Ordinal power relations and social rankings
    + Stefano Moretti and Meltem Ozturk +
  • Analyzing games with ambiguous types using the MINthenMAX decision model
    + Ilan Nehama +
  • Parameterized Complexity of Group Activity Selection Problem and Stable Invitations Problem
    + Hooyeon Lee and Virginia Vassilevska Williams +
  • Rules for Choosing Societal Tradeoffs
    + Vincent Conitzer, Rupert Freeman, Markus Brill and Yuqian Li +
  • Fair Social Choice in Dynamic Settings
    + Rupert Freeman, Seyed Majid Zahedi and Vincent Conitzer +
  • Computing Pareto Optimal Committees
    + Haris Aziz, Jérôme Lang and Jerome Monnot + +
      + +

      Accepted papers will be distributed through the webpage.

      + +

      + + +
+ + + + + + + + +
+ + +
+ + + diff --git a/comsoc-website/archive/comsoc-2016/background.html b/comsoc-website/archive/comsoc-2016/background.html new file mode 100644 index 0000000..51ef44e --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/background.html @@ -0,0 +1,99 @@ + + + +COMSOC-2016: Sixth International Workshop on Computational Social Choice + + + + + +
+ + + + +
+ +
+ Sixth International Workshop on Computational Social Choice
+ Toulouse, France, 22–24 June 2016 +
+
+ + + + + + + + + + + + + + +
+ +     + + + +

What is Computational Social Choice?

+ +

+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, social welfare orderings originally developed to analyze the quality of resource allocations in human society are equally well applicable to problems in multiagent systems or network design. +

+ +

+Social choice theory is concerned with the design and analysis of methods for collective decision making. Much classical work in the field has concentrated on establishing abstract results regarding the existence (or otherwise) of procedures meeting certain requirements, but such work has not usually taken computational issues into account. For instance, while it may not be possible to design a voting protocol that makes it impossible for a voter to cheat in one way or another, it may well be the case that cheating successfully turns out to be a computationally intractable problem, which may therefore be deemed an acceptable risk. +

+ +

+Examples for topics studied in computational social choice include the complexity-theoretic analysis of voting protocols (both with a view to developing computationally feasible mechanisms, and to exploit computational intractability as a means against strategic manipulation); the formal specification and verification of social procedures such as fair division algorithms (social software); and the application of techniques developed in artificial intelligence and logic to the compact representation of preferences in combinatorial domains (such as negotiation over indivisible resources or voting for assemblies). +

+ +

+These are examples for a wider trend towards interdisciplinary research involving all of decision theory, game theory, social choice, and welfare economics on the one hand, and computer science, artificial intelligence, multiagent systems, operations research, and computational logic on the other. In particular, the mutually beneficial impact of research in game theory and computer science is already widely recognized and has lead to significant advances in areas such as combinatorial auctions, mechanism design, negotiation in multiagent systems, and applications in electronic commerce. What has been missing so far is a forum that specifically addresses issues in social choice theory. By organizing the COMSOC workshop series we hope to be able to fill this gap. +

+ + + +
+ + + + + + + + +
+ + +
+ + + + diff --git a/comsoc-website/archive/comsoc-2016/blonotesCOMSOC.pdf b/comsoc-website/archive/comsoc-2016/blonotesCOMSOC.pdf new file mode 100644 index 0000000..58a8d6c Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/blonotesCOMSOC.pdf differ diff --git a/comsoc-website/archive/comsoc-2016/cfp.html b/comsoc-website/archive/comsoc-2016/cfp.html new file mode 100644 index 0000000..6812d83 --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/cfp.html @@ -0,0 +1,159 @@ + + + +COMSOC-2016: Sixth International Workshop on Computational Social Choice + + + + + +
+ + + + +
+ +
+ Sixth International Workshop on Computational Social Choice
+ Toulouse, France, 22–24 June 2016 +
+
+ + + + + + + + + + + + + + +
+ +     + + + +

Call for Papers

+ + +

+ + + +

Submissions of papers describing original or recently published work +on all aspects of computational social choice +are invited. Topics of interest include, but are not limited to, the intersection of computational questions concerning: + +

    +
  • Algorithms (complexity, optimization, approximation...) +
  • Learning and sampling +
  • Combinatorial domains +
  • Knowledge Representation +
  • Logic +
  • Distributed approaches and communication +
  • Simulation +
+ +with areas such as: + +
    +
  • Voting: +
      +
    • Voting rules +
    • Tournament solutions +
    • Manipulation, control, and bribery +
    • Preferences +
    • Equilibria +
    +
  • Fair division: +
      +
    • Resource allocation +
    • Cake cutting +
    • Indivisible goods +
    +
  • Coalition formation: +
      +
    • Matching +
    • Hedonic games +
    • Weighted voting games +
    +
  • Related topics like: +
      +
    • Judgement aggregation +
    • Axiomatizations of Internet systems +
    • Group recommendation +
    • Software for collective decision making +
    +
+ +
+ +Papers will have to be submitted electronically via this website. +Paper submission is now open, and the deadline for submission is 15 March 2016. +All submitted papers will be reviewed by the program committee. +Accepted papers will be collected in informal workshop notes. +To accomodate the publishing needs of different scientific communities, +we stress that authors will retain the copyright of their papers and +that submitting to COMSOC-2016 should not preclude publication of the +same material in a journal or in a conference with formal proceedings. +Submission is restricted by the rule that each accepted paper should be +presented by a different author. +

+ +

+COMSOC-2016 will also include a poster session. Posters will be selected based on abstracts of up to 250 words, which can be sent by email to comsoc.toulouse@gmail.com, with the subject "COMSOC-16 poster submission", anytime before 18 May 2016. In the body of this email, please indicate whether you want to present at the Industry Day, at COMSOC, or both. Unlike regular papers, a single author is allowed to present multiple posters. +

+ +

+Please contact either one of the +program chairs should you have any questions. +

+ + + +
+ + + + + + + + +
+ + +
+ + + diff --git a/comsoc-website/archive/comsoc-2016/cfp.txt b/comsoc-website/archive/comsoc-2016/cfp.txt new file mode 100644 index 0000000..25a7224 --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/cfp.txt @@ -0,0 +1,119 @@ +********************************************************************** + + 1st Call for Papers + + Fourth International Workshop on Computational Social Choice + (COMSOC-2012) + + Krakow, Poland, September 11--13, 2012 + + URL: http://www.ki.agh.edu.pl/COMSOC-2012 + +********************************************************************** +MISSION +********************************************************************** + +Computational social choice is a discipline that emerged at the +interface of social choice theory and computer science. It is +concerned with the application of computational techniques to the +study of social choice mechanisms, and with the integration of social +choice paradigms into computing. The aim of the workshop is to bring +together different communities: computer scientists interested in +computational issues in social choice; people working in artificial +intelligence and multiagent systems who are using ideas from social +choice to organize societies of artificial software agents; logicians +interested in the logic-based specification and analysis of social +procedures; computer science theorists analyzing algorithmic +properties of social phenomena; and last but not least, people coming +from social choice theory itself. + +********************************************************************** +INVITED SPEAKERS +********************************************************************** + +Invited speakers will include Michel Le Breton (Toulouse School of +Economics; tentative), Clemens Puppe (Karlsruhe Institute of +Technology), Craig A. Tovey (Georgia Institute of Technology), Gerhard +J. Woeginger (Eindhoven University of Technology). There will also +be an invited tutorial by Rolf Niedermeier (Technische Universitaet +Berlin). + +********************************************************************** +PAPER SUBMISSION +********************************************************************** + +Submissions of full papers describing original or recently published +work on all aspects of computational social choice are invited. Topics +of interest include, but are not limited to: + + o complexity-theoretic analysis of voting procedures + o computational aspects of fair division + o computational aspects of matching problems + o multiagent resource allocation + o cake-cutting algorithms + o distributed negotiation in multiagent systems + o preference representation in combinatorial domains + o computational aspects of preference aggregation rules + o preference elicitation + o social choice and constraint programming + o social choice and the web: ranking systems + o social networks + o belief and judgement aggregation + o algorithmic game theory + o computational aspects of coalition formation + o cooperative game theory + o social choice under uncertainty + o logics for collective decision making + o logic-based verification of social procedures + o communication complexity of social choice mechanisms + o computational issues in mechanism design + +Paper submission is electronic via the workshop website. Papers should +not exceed 12 pages in length (roughly 5000 words) and should be +formatted according to the instructions available at the workshop +website. Accepted papers will be collected in informal workshop notes, +printed copies of which will be available at the workshop. Please +contact either one of the program chairs in case of any questions: + + o Felix Brandt (brandtf@in.tum.de) + o Piotr Faliszewski (faliszew@agh.edu.pl) + +********************************************************************** +IMPORTANT DATES +********************************************************************** + + o Paper submission deadline: May 25, 2012 + o Notification of authors: June 25, 2012 + o Camera-ready papers due: July 10, 2012 + o Early registration deadline: July 20, 2012 + o Late registration deadline: August 20, 2012 (afterward only on-site + registration) + o Workshop dates: September 11--13, 2012 + +********************************************************************** +PROGRAM COMMITTEE +********************************************************************** + + o Craig Boutilier + o Felix Brandt (co-chair) + o Edith Elkind + o Ulle Endriss + o Piotr Faliszewski (co-chair) + o Bettina Klaus + o Jérôme Lang + o Christian List + o Hannu Nurmi + o Maria Silvia Pini + o Ariel Procaccia + o Jeffrey S. Rosenschein + o Jörg Rothe + o Tuomas Sandholm + o Michael Trick + o Virginia Vassilevska-Williams + o Toby Walsh + o Michael Wooldridge + o Lirong Xia + o Makoto Yokoo + o William S. Zwicker + +********************************************************************** diff --git a/comsoc-website/archive/comsoc-2016/cfp2.txt b/comsoc-website/archive/comsoc-2016/cfp2.txt new file mode 100644 index 0000000..b0a461e --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/cfp2.txt @@ -0,0 +1,119 @@ +********************************************************************** + + 2nd Call for Papers + + Fourth International Workshop on Computational Social Choice + (COMSOC-2012) + + Krakow, Poland, September 11--13, 2012 + + URL: http://www.ki.agh.edu.pl/COMSOC-2012 + +********************************************************************** +MISSION +********************************************************************** + +Computational social choice is a discipline that emerged at the +interface of social choice theory and computer science. It is +concerned with the application of computational techniques to the +study of social choice mechanisms, and with the integration of social +choice paradigms into computing. The aim of the workshop is to bring +together different communities: computer scientists interested in +computational issues in social choice; people working in artificial +intelligence and multiagent systems who are using ideas from social +choice to organize societies of artificial software agents; logicians +interested in the logic-based specification and analysis of social +procedures; computer science theorists analyzing algorithmic +properties of social phenomena; and last but not least, people coming +from social choice theory itself. + +********************************************************************** +INVITED SPEAKERS +********************************************************************** + +Invited speakers will include Michel Le Breton (Toulouse School of +Economics; tentative), Clemens Puppe (Karlsruhe Institute of +Technology), Craig A. Tovey (Georgia Institute of Technology), Gerhard +J. Woeginger (Eindhoven University of Technology). There will also +be an invited tutorial by Rolf Niedermeier (Technische Universitaet +Berlin). + +********************************************************************** +PAPER SUBMISSION +********************************************************************** + +Submissions of full papers describing original or recently published +work on all aspects of computational social choice are invited. Topics +of interest include, but are not limited to: + + o complexity-theoretic analysis of voting procedures + o computational aspects of fair division + o computational aspects of matching problems + o multiagent resource allocation + o cake-cutting algorithms + o distributed negotiation in multiagent systems + o preference representation in combinatorial domains + o computational aspects of preference aggregation rules + o preference elicitation + o social choice and constraint programming + o social choice and the web: ranking systems + o social networks + o belief and judgement aggregation + o algorithmic game theory + o computational aspects of coalition formation + o cooperative game theory + o social choice under uncertainty + o logics for collective decision making + o logic-based verification of social procedures + o communication complexity of social choice mechanisms + o computational issues in mechanism design + +Paper submission is electronic via the workshop website. Papers should +not exceed 12 pages in length (roughly 5000 words) and should be +formatted according to the instructions available at the workshop +website. Accepted papers will be collected in informal workshop notes, +printed copies of which will be available at the workshop. Please +contact either one of the program chairs in case of any questions: + + o Felix Brandt (brandtf@in.tum.de) + o Piotr Faliszewski (faliszew@agh.edu.pl) + +********************************************************************** +IMPORTANT DATES +********************************************************************** + + o Paper submission deadline: May 25, 2012 + o Notification of authors: June 25, 2012 + o Camera-ready papers due: July 10, 2012 + o Early registration deadline: July 20, 2012 + o Late registration deadline: August 20, 2012 (afterward only on-site + registration) + o Workshop dates: September 11--13, 2012 + +********************************************************************** +PROGRAM COMMITTEE +********************************************************************** + + o Craig Boutilier + o Felix Brandt (co-chair) + o Edith Elkind + o Ulle Endriss + o Piotr Faliszewski (co-chair) + o Bettina Klaus + o Jérôme Lang + o Christian List + o Hannu Nurmi + o Maria Silvia Pini + o Ariel Procaccia + o Jeffrey S. Rosenschein + o Jörg Rothe + o Tuomas Sandholm + o Michael Trick + o Virginia Vassilevska-Williams + o Toby Walsh + o Michael Wooldridge + o Lirong Xia + o Makoto Yokoo + o William S. Zwicker + +********************************************************************** diff --git a/comsoc-website/archive/comsoc-2016/citadines.pdf b/comsoc-website/archive/comsoc-2016/citadines.pdf new file mode 100644 index 0000000..33e22aa Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/citadines.pdf differ diff --git a/comsoc-website/archive/comsoc-2016/contact.html b/comsoc-website/archive/comsoc-2016/contact.html new file mode 100644 index 0000000..4ce56ee --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/contact.html @@ -0,0 +1,97 @@ + + + +COMSOC-2016: Sixth International Workshop on Computational Social Choice + + + + + +
+ + + + +
+ +
+ Sixth International Workshop on Computational Social Choice
+ Toulouse, France, 22–24 June 2016 +
+
+ + + + + + + + + + + + + + +
+ +     + + + + + +

Contact

+ +

+If you have any questions or comments regarding the organization of +COMSOC-2016 or the paper submission procedure, please do not hesitate +to contact either one of the program chairs: + +

+ +

+ + + +
+ + + + + + + + +
+ + +
+ + + + diff --git a/comsoc-website/archive/comsoc-2016/dates.html b/comsoc-website/archive/comsoc-2016/dates.html new file mode 100644 index 0000000..19ef419 --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/dates.html @@ -0,0 +1,126 @@ + + + +COMSOC-2016: Sixth International Workshop on Computational Social Choice + + + + + +
+ + + + +
+ +
+ Sixth International Workshop on Computational Social Choice
+ Toulouse, France, 22–24 June 2016 +
+
+ + + + + + + + + + + + + + +
+ +     + + + +

Important Dates

+ + +

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Paper submission deadline:    15 March 2016 (midnight, anywhere on Earth)
Notification to authors:25 April 2016
Early registration deadline:18 May 2016
Submission deadline for posters:   18 May 2016
COST IC1205 Industry Day:21 June 2016
Workshop dates:22–24 June 2016
+

+ + + +
+ + + + + + + + +
+ + +
+ + + diff --git a/comsoc-website/archive/comsoc-2016/flyer/flyer_comsoc2016.pdf b/comsoc-website/archive/comsoc-2016/flyer/flyer_comsoc2016.pdf new file mode 100644 index 0000000..4b295c4 Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/flyer_comsoc2016.pdf differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/AIJ.jpg b/comsoc-website/archive/comsoc-2016/flyer/images/AIJ.jpg new file mode 100644 index 0000000..91d5bcb Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/AIJ.jpg differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/ILLCmark.jpg b/comsoc-website/archive/comsoc-2016/flyer/images/ILLCmark.jpg new file mode 100644 index 0000000..11336f8 Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/ILLCmark.jpg differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/clico.gif b/comsoc-website/archive/comsoc-2016/flyer/images/clico.gif new file mode 100644 index 0000000..5fc9ca5 Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/clico.gif differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/cost-logo-grey.png b/comsoc-website/archive/comsoc-2016/flyer/images/cost-logo-grey.png new file mode 100644 index 0000000..678976d Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/cost-logo-grey.png differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/eu-flag.png b/comsoc-website/archive/comsoc-2016/flyer/images/eu-flag.png new file mode 100644 index 0000000..6a12c44 Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/eu-flag.png differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/iast.png b/comsoc-website/archive/comsoc-2016/flyer/images/iast.png new file mode 100644 index 0000000..85f9647 Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/iast.png differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/irit.png b/comsoc-website/archive/comsoc-2016/flyer/images/irit.png new file mode 100644 index 0000000..2643ad2 Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/irit.png differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/kic.png b/comsoc-website/archive/comsoc-2016/flyer/images/kic.png new file mode 100644 index 0000000..af00acf Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/kic.png differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/krakow.jpg b/comsoc-website/archive/comsoc-2016/flyer/images/krakow.jpg new file mode 100644 index 0000000..6e224fb Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/krakow.jpg differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/krakow2.jpg b/comsoc-website/archive/comsoc-2016/flyer/images/krakow2.jpg new file mode 100644 index 0000000..3fe7275 Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/krakow2.jpg differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/old.toulouse.jpg b/comsoc-website/archive/comsoc-2016/flyer/images/old.toulouse.jpg new file mode 100644 index 0000000..c67b97a Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/old.toulouse.jpg differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/toulouse.jpg b/comsoc-website/archive/comsoc-2016/flyer/images/toulouse.jpg new file mode 100644 index 0000000..71275c5 Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/toulouse.jpg differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/ut1.png b/comsoc-website/archive/comsoc-2016/flyer/images/ut1.png new file mode 100644 index 0000000..ce1bdf9 Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/ut1.png differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/images/ut3.png b/comsoc-website/archive/comsoc-2016/flyer/images/ut3.png new file mode 100644 index 0000000..e1ae983 Binary files /dev/null and b/comsoc-website/archive/comsoc-2016/flyer/images/ut3.png differ diff --git a/comsoc-website/archive/comsoc-2016/flyer/index.php b/comsoc-website/archive/comsoc-2016/flyer/index.php new file mode 100644 index 0000000..89788de --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/flyer/index.php @@ -0,0 +1,151 @@ + + + +COMSOC-2016: Sixth International Workshop on Computational Social Choice + + + + + +
+ + + + +
+ +
+ Sixth International Workshop on Computational Social Choice
+ Toulouse, France, 22–24 June 2016 +
+
+ + + + + + + + + + + + + + +
+ +     + + + +

About COMSOC-2016 ...

+ + +

Computational social choice is a rapidly growing discipline at the +interface of social choice theory and computer science. It is +concerned with the application of computational techniques to the +study of social choice mechanisms, and with the integration of social +choice paradigms into computing.

+ +

The Sixth International Workshop on Computational Social Choice +(COMSOC-2016) will take place on June 22–24, 2016, in Toulouse, France. +It will be hosted by the +Institut de Recherche en Informatique de Toulouse (IRIT) + of the +University of Toulouse. +The aim of the workshop is to bring together different communities: +computer scientists interested in computational issues in +social choice; people working in artificial intelligence and +multiagent systems who are using ideas from social choice to organize +societies of artificial software agents; logicians interested in the +logic-based specification and analysis of social procedures; +computer science theorists analyzing algorithmic properties of social phenomena; +and last but not least people coming from social choice +theory itself: economists, mathematicians, and political scientists.

+ +

+COMSOC-2016 is temporally co-located with The 13th Meeting of the Society for Social Choice and Welfare, which will take place on June 28th–July 1st at Lund University, Sweden. +

+ +
+ +

Call for Papers

+

+Submissions of papers describing original or recently published work on all aspects of computational social choice are invited. Papers will have to be submitted electronically via the workshop webpage, and accepted papers will be collected in informal workshop notes. COMSOC-2016 will also include a poster session, with selection based on abstract submitted by emails. A full call for papers is available on the COMSOC-2016 webpage: www.irit.fr/COMSOC-2016/cfp.php +

+ +

+For additional information please consult the workshop webpage: www.irit.fr/COMSOC-2016 +

+ +
+ +

Sponsors

+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
+
+ +
+
+ + + + + +
+ + + + + + + +
+
diff --git a/comsoc-website/archive/comsoc-2016/flyer/web/comsoc.css b/comsoc-website/archive/comsoc-2016/flyer/web/comsoc.css new file mode 100644 index 0000000..12fac30 --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/flyer/web/comsoc.css @@ -0,0 +1,129 @@ +body { + font-family: georgia, verdana, arial, "ms sans serif", sans-serif; + font-size: 14px; + line-height: 20px; + margin: 6px 0px; + color: #999999; + background-color: #FFFFFF; +} + +p, table, ul, li { + font-family: georgia, verdana, arial, "ms sans serif", sans-serif; + font-size: 14px; + line-height: 20px; + margin: 6px 0px; + color: #666666; +} + +div#top { + font-family: georgia, verdana, arial, "ms sans serif", sans-serif; + font-weight: bold; + font-size: 22px; + line-height: 28px; + margin: 8px 8px; +/* color: #998877; */ + color: #B8512D; +} + +div#footer { + font-family: georgia, verdana, arial, "ms sans serif", sans-serif; + font-size: 12px; + line-height: 12px; + margin: 4px 4px; + color: #999999; +} + +h1 { + font-size: 22px; + font-weight: bold; + line-height: 22px; + margin: 1px 0px; +/* color: #998877; */ + color: #B8512D; +} + + +h2 { + font-size: 14px; + font-weight: bold; + line-height: 26px; + margin: 1px 0px; +/* color: #998877; */ + color: #805000; +} + + +a:link { +/* color: #EE9955;*/ + color: #B8512D; +} + +a:visited { +/* color: #EE9955;*/ + color: #B8512D; +} + +a:active { + color: #000000; +} + +a:hover { + color: #000000; +} + + +div#menu a { + font-family: georgia, verdana, arial, "ms sans serif", sans-serif; + font-size: 14px; + line-height: 18px; +/* color: #EE9955;*/ + color: #B8512D; + text-decoration: none; + display: block; + padding: 3px; + width: 160px; + text-align: left; + background-color: #EEEEEE; + border-width: 2px; + border-style: solid; + border-color: white; +} + + +div#menu a:hover { + font-family: georgia, verdana, arial, "ms sans serif", sans-serif; + font-size: 14px; + line-height: 18px; +/* color: #FFFFFF;*/ + color: #FFFFA0; + text-decoration: none; + display: block; + padding: 3px; + width: 160px; + text-align: left; +/* background-color: #998877;*/ + background-color: #B8512D; + border-width: 2px; + border-style: solid; + border-color: white; +} + + +div#menu a:active { + font-family: georgia, verdana, arial, "ms sans serif", sans-serif; + font-size: 14px; + line-height: 18px; +/* color: #FFFFFF;*/ + color: #FFFFA0; + text-decoration: none; + display: block; + padding: 3px; + width: 160px; + text-align: left; +/* background-color: #998877;*/ + background-color: #B8512D; + border-width: 2px; + border-style: solid; + border-color: white; +} + diff --git a/comsoc-website/archive/comsoc-2016/flyer/web/footer-1.html b/comsoc-website/archive/comsoc-2016/flyer/web/footer-1.html new file mode 100644 index 0000000..8e2cc91 --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/flyer/web/footer-1.html @@ -0,0 +1,12 @@ + +
+ + + + + + + + +
+ + +
+ + + diff --git a/comsoc-website/archive/comsoc-2016/flyer/web/header.html b/comsoc-website/archive/comsoc-2016/flyer/web/header.html new file mode 100644 index 0000000..54c90aa --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/flyer/web/header.html @@ -0,0 +1,83 @@ + + + +COMSOC-2016: Sixth International Workshop on Computational Social Choice + + + + + +
+ + + + +
+ +
+ Sixth International Workshop on Computational Social Choice
+ Toulouse, France, 22–24 June 2016 +
+
+ + + + + + + + + + + + + + + + +
+ + + +

Invited Speakers

+ +
+ +
    +
  • Marc Fleurbaey
    +Princeton University +
  • Tayfun Sönmez
    +Boston College +
  • Éva Tardos
    +Cornell University +
+ +
+ +

Important Dates

+
+ +
    +
  • Paper submission:
    +15 March 2016 +
  • Notification:
    25 April 2016 +
  • COST Industry Day:
    21 June 2016 +
  • Workshop:
    22-24 June 2016 +
+ +
+ +

Contacts

+ +
+
    +
  • Umberto Grandi
    +umberto.grandi@irit.fr +
  • Jeffrey S. Rosenschein
    +jeff@cs.huji.ac.il +
+ +
+ + + +
     + diff --git a/comsoc-website/archive/comsoc-2016/flyer/web/invited.html b/comsoc-website/archive/comsoc-2016/flyer/web/invited.html new file mode 100644 index 0000000..7336ebc --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/flyer/web/invited.html @@ -0,0 +1,18 @@ + + +

Invited Speakers

+ +

+

+ + + + + + + + + +
+ + + + + + + + +
+ + +
+ + + diff --git a/comsoc-website/archive/comsoc-2016/web/header.html b/comsoc-website/archive/comsoc-2016/web/header.html new file mode 100644 index 0000000..7b839e0 --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/web/header.html @@ -0,0 +1,57 @@ + + + +COMSOC-2016: Sixth International Workshop on Computational Social Choice + + + + + +
+ + + + +
+ +
+ Sixth International Workshop on Computational Social Choice
+ Toulouse, France, 22–24 June 2016 +
+
+ + + + + + + + + + + + +
+ +     + diff --git a/comsoc-website/archive/comsoc-2016/web/header.html.orig b/comsoc-website/archive/comsoc-2016/web/header.html.orig new file mode 100644 index 0000000..4b9c737 --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/web/header.html.orig @@ -0,0 +1,57 @@ + + + +COMSOC-2016: Sixth International Workshop on Computational Social Choice + + + + + +
+ + + + +
+ +
+ Sixth International Workshop on Computational Social Choice
+ Toulouse, France, 22–24 June 2016 +
+
+ + + + + + + + + + + + +
+ +     + diff --git a/comsoc-website/archive/comsoc-2016/web/invited.html b/comsoc-website/archive/comsoc-2016/web/invited.html new file mode 100644 index 0000000..7336ebc --- /dev/null +++ b/comsoc-website/archive/comsoc-2016/web/invited.html @@ -0,0 +1,18 @@ + + +

Invited Speakers

+ +

+