JSAI2020

Presentation information

Organized Session

Organized Session » OS-17

[2N4-OS-17a] OS-17 (1)

Wed. Jun 10, 2020 1:50 PM - 3:30 PM Room N (jsai2020online-14)

宋 剛秀(神戸大学)、沖本 天太(神戸大学)

1:50 PM - 2:30 PM

[2N4-OS-17a-01] (OS invited talk) Theory of Constrained Matching

〇Makoto Yokoo1 (1. Kyushu University)

Keywords:Matching, constraints, game theory, mechanism design

The theory of two-sided matching (e.g., assigning residents to hospitals, students to schools) has been extensively developed, and it has been applied to design clearinghouse mechanisms in various markets in practice. As the theory has been applied to increasingly diverse types of environments, however, researchers and practitioners have encountered various forms of distributional constraints. As these features have been precluded from consideration until recently, they pose new challenges for market designers. One example of such distributional constraints is a minimum quota, e.g., school districts may need at least a certain number of students in each school in order for the school to operate. In this talk, I present an overview of research on designing mechanisms that work under distributional constraints.

Authentication for paper PDF access

A password is required to view paper PDFs. If you are a registered participant, please log on the site from Participant Log In.
You could view the PDF with entering the PDF viewing password bellow.

Password