Embedded Files
Opening remarks
9:30 - 10:30 Technical Session (3 papers, 20 mins each)
Session chair: Yair Zick
Fair Division with Subjective Divisibility
Xiaohui Bei, Shengxin Liu, Xinhang Lu
Individual Fairness under Group Fairness Constraints in Bipartite Matching - One Framework to Approximate Them All
Atasi Panda, Anand Louis, Prajakta Nimbhorkar
Capacity Modification in the Stable Matching Problem
Salil Gokhale, Samarth Singla, Shivika Narang, Rohit Vaish
Coffee break
Session chair: Aris Filos-Ratsikas
11:00-12:00 Keynote by Ayumi Igarashi: Fair division of household chores
12:00-12:20 Technical Session (1 paper, 20 mins each)
Equitable Allocation of Mixtures of Goods and Bads
Hadi Hosseini, Aditi Sethia
Lunch break
14:00 - 15:30 Contributed Talks ( 4 talks, 22 mins each)
Session chair: Aris Filos-Ratsikas
A Simple Vision for Fair Division
Yair Zick
On Hill's Worst-Case Guarantee for Indivisible Bads
Bo Li, Hervé Moulin, Ankang Sun, Yu Zhou
A new lower bound for multi-color discrepancy with applications to fair division
Ioannis Caragiannis, Kasper Green Larsen, and Sudarshan Shyam
Fair Division of Indivisible Items with Externalities
Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Šimon Schierreich
Coffee Break
16:00 - 17:00 Panel Discussion: From Theory to Practice in Fair Division
Moderator: Aris Filos-Ratsikas
Panelists: Ayumi Igarashi, Hadi Hosseni, and Toby Walsh
17:00-17:30 Poster Presentation
Keynote Address:
Fair division of household chores
Prof. Ayumi Igarashi
How to divide household chores can be a significant source of conflict. This leads us to the fundamental question of how to divide indivisible resources. Fair division is a growing field in mathematics and computer science that offers an elegant solution to this problem. It has been successfully applied in various real-life scenarios, including the Adjusted Winner Website, Fair Division Calculator, Course Match, and Spliddit. In this presentation, I will introduce a new application of fair division to household chores. Our objective is to provide a systematic and transparent tool for dividing household tasks, thereby fostering harmony in the home.
Ayumi Igarashi is an associate professor at the University of Tokyo, Japan. Previously, she was an assistant professor in the Principles of Informatics Research Division at the National Institute of Informatics (NII) and a JSPS postdoctoral fellow at the University of Tokyo, Japan. She completed her PhD in the Department of Computer Science at the University of Oxford, UK. Her research focuses on fair division, algorithmic game theory, and computational social choice. She was selected on the Innovators Under 35 Japan 2021 list by MIT Technology Review.
Page updated
Google Sites
Report abuse