*
Limited travel support is available. More information about this will be available after the notification of acceptance. We gratefully acknowledge the generous support by Artificial Intelligence Journal (AIJ). Please reach out to
contact...@gmail.com with any questions.
Description:
The cutting-edge field of fair division has seen explosive growth in recent years, covering a wide range of important areas of interest. Recent advancements have paved the way for ground-breaking research in this area, answering important questions on how to allocate resources to agents with competing preferences while ensuring fairness, efficiency, constraint feasibility, and incentive compatibility. We invite submissions that push the boundaries of the state-of-the-art in the computational fair division on a variety of topics, including:
Classic fair allocation of indivisible items
House allocation
Constrained fair division
Uncertainty & distortion in fair division
Practical applications of fair division
Empirical analysis of resource allocation problems
Fair division with learned preferences
Fair division in social networks
Online fair division and matching
Fairness in other resource allocation problems, e.g., matching, apportionment, etc.
Resource allocation in multi-agent systems
Budget allocation
Market design
Combinatorial auctions
Incentives in fair division
Competitive/market equilibria
Cake cutting
Automated theorem proving/SAT solving approaches for fair division
Datasets for and practical implementation of fair division algorithms
Best,
CFD Workshop Organizing Committee
(Arpita Biswas, Hadi Hosseini, Justin Payan, Sekou Lionel Remy, Sanjukta Roy, Rohit Vaish, and Yair Zick)