This is the website for the January 2021 Master of Logic project on Preference Extensions in Social Choice. I'll post all information related to the project on this page. The project will start with a week of lectures. Each student will then read and present a paper. The main deliverable of the project is a final paper due at the end of the 4th week.
Here is some advice on giving a talk by Ulle Endriss. Most things you need to consider before giving any kind of presentation are mentioned, so it's helpful to read even if you might not end up implementing all his suggestions. Note that some of it is written with conference-style talks in mind, so you can ignore those parts, or save them somewhere in the back of your mind for future endeavors.
Here is a simple beamer template for those of you who might want it to make your slides. Feel free to use/create your own or play around with this one to make it more your own style.
| Monday 10:00-12:00 | Introduction. We went over the framework, saw some examples of extensions, and a first impossibility result---the Kannai-Peleg Theorem. Here's the paper by Barberà, Bossert, and Pattanaik* (Note that Thms. 8 and 9 are incorrect). And here's the paper by Kannai and Peleg. (slides.) |
|---|---|
| Tuesday 10:00-12:00 | We looked at reactions to the Kannai-Peleg Theorem. We saw an impossibility result that does not require the preferences over sets to be connex or transitive. We saw the effect of weakening axioms. We saw two more prominent extensions, and started looking at the voting framework. (slides.) |
| Thursday 10:00-12:00 | We looked at preference extensions and their role in strategyproofness results in voting.In particular we saw various generalisations of the Gibbard-Satterthwaite theorem to irresolute rules. (slides.) |
| Tuesday 10:00-11:00 | Vasily and Lukas---On the Indecisiveness of Kelly-Strategyproof Social Choice Functions |
|---|---|
| Tuesday 11:00-12:00 | Leyla, Daniela and Nicolien---Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities |
| Thursday 16:00-17:00 | Marie and Anouk---Set-Monotonicity Implies Kelly-Strategyproofness |
| Thursday 17:00-18:00 | Flavia and Hugh-Mee---Lifting Preferences over Alternatives to Preferences over Sets of Alternatives: The Complexity of Recognizing Desirable Families of Sets. |
| Friday 13:00-14:00 | Mike and Jasmijn---On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice. |
| Friday 14:00-15:00 | Bo and Tomasz---Preference Orders on Families of Sets---When Can Impossibility Results Be Avoided? |
In the third week you should all choose a paper topic and start working on your idea. During this week I want to set up meetings with each of you to discuss (and approve) your idea and discuss what you'll focus on going forward.
What I Expect from your Paper: You have two options for the final paper. You can either come up with an original idea and develop it as far as you can, or you can do a thorough analysis of existing work. The first option is not as daunting as it looks. Since this is a short project, it is ok if you don't manage to prove some amazing result, as long as you explain what your goal was and why you did not manage to come up with a proof (this does not mean something like "it was hard and I didn't have much time"). I expect everything in your papers to be correct, and well written. The deadline for the paper is at the end of the fourth week, but you will need time for the pre-writing work that goes into the paper so get started early.
In principle, any paper topic related to preference extensions is fair game. If anything piqued your interest during the first couple weeks and you already have a vague idea, that's great! Email me and we can make it less vague together. For those of you who aren't sure what to write about, I'll try to come up with a few suggestions for possible topics.
When you get to the writing stage, you can have a look at this advice on writing a paper. Your paper should be around 4-5 pages long (including references), using the IJCAI LaTeX style. The (tentative) submission deadline for the paper is Friday 29 January 2020.