Dagstuhl-Seminar 16232
Fair Division
( 05. Jun – 10. Jun, 2016 )
(zum Vergrößern in der Bildmitte klicken)
Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite:
https://www.dagstuhl.de/16232
Organisatoren
- Yonatan Aumann (Bar-Ilan University - Ramat Gan, IL)
- Steven J. Brams (New York University, US)
- Jérôme Lang (University Paris-Dauphine, FR)
- Ariel Procaccia (Carnegie Mellon University - Pittsburgh, US)
Kontakt
- Annette Beyer (für administrative Fragen)
Impacts
- Catch-Up : A Rule That Makes Service Sports More Competitive - Brams, Steven J.; Ismail, Mehmet S.; Kilgour, D. Marc; Stromquist, Walter - SSRN, 2016. - 32 pp..
- Fair Allocation based on Diminishing Differences - Segal-Halevi, Erel; Aziz, Haris; Hassidim, Avinatan - IJCAI, 2017. - pp. 1254-1260.
- Fair Division of a Graph : article in Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI 2017) - Bouveret, Sylvain; Cechlarova, Katarina; Elkind, Edith; Igarashi, Ayumi; Peters, Dominik - IJCAI, 2017. - pp. 135-141.
Fair division has been an active field of research in economics and mathematics for decades. More recently, the topic has attracted the attention of computer scientists, due to its algorithmic nature and its real-world applications. The 2016 Dagstuhl seminar on fair division will bring together top researchers in the field, from among the multiple disparate disciplines where it is studied, both within computer science and from economics and mathematics, to share knowledge and advance the state of the art.
The seminar will cover fair division of both divisible and indivisible goods. Topics will include: algorithms, lower bounds, approximations, strategic behavior, tradeoffs between fairness and efficiency, partial divisions, alternative definitions of fairness, and any other topic the participants find relevant and interesting.
We plan for five intensive days of scientific exchange, closing open questions and opening new directions, establishing collaborations, and enjoying the wonderful Dagstuhl setting at the best time of year.
Fair division has been an active field of research in economics and mathematics for decades. More recently, the topic has attracted the attention of computer scientists, due to its algorithmic nature and its real-world applications. There had been a first Dagstuhl Seminar on fair division, in 2007, and none since. The aim of the 2016 Dagstuhl seminar on fair division was to bring together top researchers in the field, from among the multiple disparate disciplines where it is studied, both within computer science and from economics and mathematics, to share knowledge and advance the state of the art.
The seminar covered fair division of both divisible and indivisible goods, with a good mix between economics and computer science (with a significant number of talks being about economics and computer science). Topics included algorithms, lower bounds, approximations, strategic behavior, tradeoffs between fairness and efficiency, partial divisions, alternative definitions of fairness, and practical applications of fair division. The ratio between the number of participants with a main background in computer science and in economics was about 3--1, with a couple of participants with another main background (mathematics or political science). This ratio is similar to the corresponding ratios for Dagstuhl seminars on computational social choice (2007, 2010, 2012, 2015).
The seminar started by a short presentation of the participants (3 minutes per attendee). The rest of the seminar was composed of technical sessions with regular talks, and discussion sessions distributed over the full week (Tuesday morning, Tuesday afternoon, Wednesday morning, Friday morning). One of these discussion sessions was specifically about Fair division in the real world, two were about open problems, and one was about high-level thoughts about the topic and its future. Moreover, there was a significant amount of time left for participants to interact in small groups.
Creative Commons BY 3.0 Unported license
Yonatan Aumann and Jérôme Lang and Ariel D. Procaccia
- Yonatan Aumann (Bar-Ilan University - Ramat Gan, IL) [dblp]
- Haris Aziz (Data61 / NICTA - Sydney, AU) [dblp]
- Sylvain Bouveret (LIG - Grenoble, FR & Université Grenoble-Alpes, FR) [dblp]
- Simina Branzei (The Hebrew University of Jerusalem, IL) [dblp]
- Katarina Cechlarova (Pavol Jozef Šafárik University - Košice, SK) [dblp]
- Yann Chevaleyre (University of Paris North, FR) [dblp]
- Marco Dall'Aglio (LUISS Guido Carli - Rome, IT) [dblp]
- Edith Elkind (University of Oxford, GB) [dblp]
- Ulle Endriss (University of Amsterdam, NL) [dblp]
- Serge Gaspers (UNSW - Sydney, AU) [dblp]
- Vasilis Gkatzelis (Stanford University, US) [dblp]
- Laurent Gourves (University Paris-Dauphine, FR) [dblp]
- Avinatan Hassidim (Bar-Ilan University - Ramat Gan, IL) [dblp]
- Dorothea Herreiner (Loyola Marymount University, US) [dblp]
- Mehmet Ismail (Maastricht University, NL)
- Michael A. Jones (Mathematical Reviews - Ann Arbor, US) [dblp]
- Marc Kilgour (Wilfrid Laurier University, CA) [dblp]
- Christian Klamler (Universität Graz, AT) [dblp]
- David Kurokawa (Carnegie Mellon University - Pittsburgh, US) [dblp]
- Jérôme Lang (University Paris-Dauphine, FR) [dblp]
- Simon William Mackenzie (UNSW - Sydney, AU) [dblp]
- Hervé J. Moulin (University of Glasgow, GB) [dblp]
- Nhan-Tam Nguyen (Heinrich-Heine-Universität Düsseldorf, DE) [dblp]
- Trung Thanh Nguyen (New York University - Abu Dhabi, AE) [dblp]
- Ariel Procaccia (Carnegie Mellon University - Pittsburgh, US) [dblp]
- Clemens Puppe (KIT - Karlsruher Institut für Technologie, DE) [dblp]
- Jörg Rothe (Heinrich-Heine-Universität Düsseldorf, DE) [dblp]
- Uzi Segal (Boston College, US) [dblp]
- Erel Segal-Halevi (Bar-Ilan University - Ramat Gan, IL) [dblp]
- Walter Stromquist (Swarthmore College, US) [dblp]
- Taiki Todo (Kyushu University - Fukuoka, JP) [dblp]
- Toby Walsh (UNSW - Sydney, AU) [dblp]
Verwandte Seminare
- Dagstuhl-Seminar 07261: Fair Division (2007-06-24 - 2007-06-29) (Details)
Klassifikation
- artificial intelligence / robotics
- data structures / algorithms / complexity
Schlagworte
- Fair division
- Cake cutting
- Envy-freeness
- Computational social choice
