7 papers
Compatible -Relaxations of Fairness and Non-Wastefulness Under Hereditary Constraints
Tenma Wakasugi, Zhaohong Sun, Kei Kimura +1
We study two-sided matching markets under hereditary constraints, which extend beyond simple capacity limits and arise in applications such as diversity requirements and refugee re…
Solving a Stackelberg Game on Transportation Networks in a Dynamic Crime Scenario: A Mixed Approach on Multi-Layer Networks
Sukanya Samanta, Kei Kimura, Makoto Yokoo +1
Interdicting a criminal with limited police resources is a challenging task as the criminal changes location over time. The size of the large transportation network further adds to…
A New Relaxation of Fairness in Two-Sided Matching Respecting Acquaintance Relationships
Ryota Takeshima, Kei Kimura, Ayumu Kuroki +2
Two-sided matching, such as matching between students and schools, has been applied to various aspects of real life and has been the subject of much research, however, it has been…
Whoever Said Money Won't Solve All Your Problems? Weighted Envy-free Allocation with Subsidy
Noga Klein Elmalem, Haris Aziz, Rica Gonen +7
We explore solutions for fairly allocating indivisible items among agents assigned weights representing their entitlements. Our fairness goal is weighted-envy-freeness (WEF), where…
Parameterized Voter Relevance in Facility Location Games with Tree-Shaped Invitation Graphs
Ryoto Ando, Kei Kimura, Taiki Todo +1
Diffusion mechanism design, which investigate how to incentivise agents to invite as many colleagues to a multi-agent decision making as possible, is a new research paradigm at the…
Weighted Envy-free Allocation with Subsidy
Haris Aziz, Xin Huang, Kei Kimura +4
We consider the problem of fair allocation of indivisible items with subsidies when agents have weighted entitlements. After highlighting several important differences from the unw…