Controlled school choice with soft bounds and overlapping types

Ryoji Kurata, Masahiro Goto, Atsushi Iwasaki, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

School choice programs are implemented to give students/parents an opportunity to choose the public school the students attend. Controlled school choice programs need to provide choices for students/parents while maintaining distributional constraints on the balance on the composition of students, typically in terms of socioeconomic status. Previous works show that setting soft-bounds, which flexibly change the priorities of students based on their types, is more appropriate than setting hard-bounds, which strictly limit the number of accepted students for each type. We consider a case where soft-bounds are imposed and one student can belong to multiple types, e.g., "financially-distressed" and "minority" types. We first show that when we apply a model that is a straightforward extension of an existing model for disjoint types, there is a chance that no stable matching exists. Thus, we propose an alternative model and an alternative stability definition, where a school has reserved seats for each type. We show that a stable matching is guaranteed to exist in this model, and develop a mechanism called Deferred Acceptance for Overlapping Types (DA-OT). The DA-OT mechanism is strategy-proof and obtains the student-optimal matching within all stable matchings. Computer simulation results illustrate that the DA-OT outperforms an artificial cap mechanism, where the number of seats for each type is fixed.

Original languageEnglish
Title of host publicationProceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015
PublisherAI Access Foundation
Pages951-957
Number of pages7
ISBN (Electronic)9781577357001
Publication statusPublished - Jun 1 2015
Event29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015 - Austin, United States
Duration: Jan 25 2015Jan 30 2015

Publication series

NameProceedings of the National Conference on Artificial Intelligence
Volume2

Other

Other29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015
CountryUnited States
CityAustin
Period1/25/151/30/15

Fingerprint

Students
Seats
Computer simulation
Chemical analysis

All Science Journal Classification (ASJC) codes

  • Software
  • Artificial Intelligence

Cite this

Kurata, R., Goto, M., Iwasaki, A., & Yokoo, M. (2015). Controlled school choice with soft bounds and overlapping types. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015 (pp. 951-957). (Proceedings of the National Conference on Artificial Intelligence; Vol. 2). AI Access Foundation.

Controlled school choice with soft bounds and overlapping types. / Kurata, Ryoji; Goto, Masahiro; Iwasaki, Atsushi; Yokoo, Makoto.

Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015. AI Access Foundation, 2015. p. 951-957 (Proceedings of the National Conference on Artificial Intelligence; Vol. 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kurata, R, Goto, M, Iwasaki, A & Yokoo, M 2015, Controlled school choice with soft bounds and overlapping types. in Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015. Proceedings of the National Conference on Artificial Intelligence, vol. 2, AI Access Foundation, pp. 951-957, 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015, Austin, United States, 1/25/15.
Kurata R, Goto M, Iwasaki A, Yokoo M. Controlled school choice with soft bounds and overlapping types. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015. AI Access Foundation. 2015. p. 951-957. (Proceedings of the National Conference on Artificial Intelligence).
Kurata, Ryoji ; Goto, Masahiro ; Iwasaki, Atsushi ; Yokoo, Makoto. / Controlled school choice with soft bounds and overlapping types. Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015. AI Access Foundation, 2015. pp. 951-957 (Proceedings of the National Conference on Artificial Intelligence).
@inproceedings{223f0864a8cf4ae1b50e23168a1c5955,
title = "Controlled school choice with soft bounds and overlapping types",
abstract = "School choice programs are implemented to give students/parents an opportunity to choose the public school the students attend. Controlled school choice programs need to provide choices for students/parents while maintaining distributional constraints on the balance on the composition of students, typically in terms of socioeconomic status. Previous works show that setting soft-bounds, which flexibly change the priorities of students based on their types, is more appropriate than setting hard-bounds, which strictly limit the number of accepted students for each type. We consider a case where soft-bounds are imposed and one student can belong to multiple types, e.g., {"}financially-distressed{"} and {"}minority{"} types. We first show that when we apply a model that is a straightforward extension of an existing model for disjoint types, there is a chance that no stable matching exists. Thus, we propose an alternative model and an alternative stability definition, where a school has reserved seats for each type. We show that a stable matching is guaranteed to exist in this model, and develop a mechanism called Deferred Acceptance for Overlapping Types (DA-OT). The DA-OT mechanism is strategy-proof and obtains the student-optimal matching within all stable matchings. Computer simulation results illustrate that the DA-OT outperforms an artificial cap mechanism, where the number of seats for each type is fixed.",
author = "Ryoji Kurata and Masahiro Goto and Atsushi Iwasaki and Makoto Yokoo",
year = "2015",
month = "6",
day = "1",
language = "English",
series = "Proceedings of the National Conference on Artificial Intelligence",
publisher = "AI Access Foundation",
pages = "951--957",
booktitle = "Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015",
address = "United States",

}

TY - GEN

T1 - Controlled school choice with soft bounds and overlapping types

AU - Kurata, Ryoji

AU - Goto, Masahiro

AU - Iwasaki, Atsushi

AU - Yokoo, Makoto

PY - 2015/6/1

Y1 - 2015/6/1

N2 - School choice programs are implemented to give students/parents an opportunity to choose the public school the students attend. Controlled school choice programs need to provide choices for students/parents while maintaining distributional constraints on the balance on the composition of students, typically in terms of socioeconomic status. Previous works show that setting soft-bounds, which flexibly change the priorities of students based on their types, is more appropriate than setting hard-bounds, which strictly limit the number of accepted students for each type. We consider a case where soft-bounds are imposed and one student can belong to multiple types, e.g., "financially-distressed" and "minority" types. We first show that when we apply a model that is a straightforward extension of an existing model for disjoint types, there is a chance that no stable matching exists. Thus, we propose an alternative model and an alternative stability definition, where a school has reserved seats for each type. We show that a stable matching is guaranteed to exist in this model, and develop a mechanism called Deferred Acceptance for Overlapping Types (DA-OT). The DA-OT mechanism is strategy-proof and obtains the student-optimal matching within all stable matchings. Computer simulation results illustrate that the DA-OT outperforms an artificial cap mechanism, where the number of seats for each type is fixed.

AB - School choice programs are implemented to give students/parents an opportunity to choose the public school the students attend. Controlled school choice programs need to provide choices for students/parents while maintaining distributional constraints on the balance on the composition of students, typically in terms of socioeconomic status. Previous works show that setting soft-bounds, which flexibly change the priorities of students based on their types, is more appropriate than setting hard-bounds, which strictly limit the number of accepted students for each type. We consider a case where soft-bounds are imposed and one student can belong to multiple types, e.g., "financially-distressed" and "minority" types. We first show that when we apply a model that is a straightforward extension of an existing model for disjoint types, there is a chance that no stable matching exists. Thus, we propose an alternative model and an alternative stability definition, where a school has reserved seats for each type. We show that a stable matching is guaranteed to exist in this model, and develop a mechanism called Deferred Acceptance for Overlapping Types (DA-OT). The DA-OT mechanism is strategy-proof and obtains the student-optimal matching within all stable matchings. Computer simulation results illustrate that the DA-OT outperforms an artificial cap mechanism, where the number of seats for each type is fixed.

UR - http://www.scopus.com/inward/record.url?scp=84959917439&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84959917439&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84959917439

T3 - Proceedings of the National Conference on Artificial Intelligence

SP - 951

EP - 957

BT - Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015

PB - AI Access Foundation

ER -