most citedTowards Optimal Subsidy Bounds for Envy-freeable Allocations

3 citations · 3 across the 7 of their papers we have counts for

collaborators

7 papers

cs.GT2024

Achieving Balanced Representation in School Choice with Diversity Goals

Zhaohong Sun, Makoto Yokoo

Student placements under diversity constraints are a common practice globally. This paper addresses the selection of students by a single school under a \emph{one-to-one convention…

cs.GT2024

Neural Double Auction Mechanism

Tsuyoshi Suehara, Koh Takeuchi, Hisashi Kashima +3

Mechanism design, a branch of economics, aims to design rules that can autonomously achieve desired outcomes in resource allocation and public decision making. The research on mech…

cs.GT2024

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…

cs.LG2024

Online -Convex Minimization

Ken Yokoyama, Shinji Ito, Tatsuya Matsuoka +2

An online decision-making problem is a learning problem in which a player repeatedly makes decisions in order to minimize the long-term loss. These problems that emerge in applicat…

cs.GT2024

Fairness and efficiency trade-off in two-sided matching

Sung-Ho Cho, Kei Kimura, Kiki Liu +5

The theory of two-sided matching has been extensively developed and applied to many real-life application domains. As the theory has been applied to increasingly diverse types of e…

cs.GT2024

Stable Matchings in Practice: A Constraint Programming Approach

Zhaohong Sun, Naoyuki Yamada, Yoshihiro Takenami +2

We study a practical two-sided matching problem of allocating children to daycare centers, which has significant social implications. We are cooperating with several municipalities…