Tentative Program
9:00-10:30 [Session chair: Haris Aziz]
9:00-9:05: Opening words by the organizers
9:05 - 9:30 Eric Bahel, Justin Leroux and Christian Trudeau: Choosing between non-mutually exclusive social groups
9:30-10:30 Invited talk by Prof. William Thomson
10:30-11:00: Coffee Break
11-12:30: [Session chair: Yair Zick]
Parham Shams, Aurélie Beynier, Sylvain Bouveret and Nicolas Maudet
Minimizing and balancing envy among agents using Ordered Weighted Average
Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci and William S. Zwicker: Almost Envy-Free Allocations with Connected Bundles
Haris Aziz, Bo Li and Xiaowei Wu: Strategyproof and Approximately Maxmin Fair Share Allocation of Chores
Nawal Benabbou, Mithun Chakraborty, Edith Elkind and Yair Zick Fairness Towards Groups of Agents in the Allocation of Indivisible Items
12:30-2:00 Lunch
2:00-3:30 [Session chair: John Dickerson]
Rupert Freeman, David Pennock, Dominik Peters and Jennifer Wortman Vaughan: Truthful Aggregation of Budget Proposals
Rica Gonen and Anat Lerner: Towards Characterizing the Deterministic Combinatorial Constrained Efficient Space
Chaya Levinger, Noam Hazon and Amos Azaria: Cost Allocation for Prioritized Ride-Sharing
3:30-4:00 Coffee Break
4:00-6:00 [Session chair: Yair Zick]
Alan Tsang, Bryan Wilder, Eric Rice, Milind Tambe and Yair Zick: Group-Fairness in Influence Maximization
Itay Shtechman, Rica Gonen and Erel Segal-Halevi: Fair Cake-Cutting Algorithms with Real Land-Value Data
Szilvia Papai and Pooya Ghasvareh: Fairness Comparisons of Strategyproof and Efficient Matching Rules
Haris Aziz, Serge Gaspers and Zhaohong Sun: Mechanism Design for School Choice with Soft Diversity Constraints