13 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…
Coalitions on the Fly in Cooperative Games
Yao Zhang, Indrajit Saha, Zhaohong Sun +1
In this work, we examine a sequential setting of a cooperative game in which players arrive dynamically to form coalitions and complete tasks either together or individually, depen…
COBRA: Contextual Bandit Algorithm for Ensuring Truthful Strategic Agents
Arun Verma, Indrajit Saha, Makoto Yokoo +1
This paper considers a contextual bandit problem involving multiple agents, where a learner sequentially observes the contexts and the agent's reported arms, and then selects the a…
Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies
Arun Verma, Indrajit Saha, Makoto Yokoo +1
This paper considers a novel variant of the online fair division problem involving multiple agents in which a learner sequentially observes an indivisible item that has to be irrev…