Strategyproof and fair matching mechanism for union of symmetric m-convex constraints

Yuzhe Zhang, Kentaro Yahiro, Nathanaël Barrot, Makoto Yokoo

研究成果: 著書/レポートタイプへの貢献会議での発言

抄録

In this paper, we identify a new class of distributional constraints defined as a union of symmetric M-convex sets, which can represent a variety of real-life constraints in two-sided matching settings. Since M-convexity is not closed under union, a union of symmetric M-convex sets does not belong to this well-behaved class of constraints in general. Thus, developing a fair and strategyproof mechanism that can handle this class is challenging. We present a novel mechanism called Quota Reduction Deferred Acceptance (QRDA), which repeatedly applies the standard DA mechanism by sequentially reducing artificially introduced maximum quotas. We show that QRDA is fair and strategyproof when handling a union of symmetric M-convex sets. Furthermore, in comparison to a baseline mechanism called Artificial Cap Deferred Acceptance (ACDA), QRDA always obtains a weakly better matching for students and, experimentally, performs better in terms of nonwastefulness.

元の言語英語
ホスト出版物のタイトルProceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018
編集者Jerome Lang
出版者International Joint Conferences on Artificial Intelligence
ページ590-596
ページ数7
ISBN(電子版)9780999241127
出版物ステータス出版済み - 1 1 2018
イベント27th International Joint Conference on Artificial Intelligence, IJCAI 2018 - Stockholm, スウェーデン
継続期間: 7 13 20187 19 2018

出版物シリーズ

名前IJCAI International Joint Conference on Artificial Intelligence
2018-July
ISSN(印刷物)1045-0823

その他

その他27th International Joint Conference on Artificial Intelligence, IJCAI 2018
スウェーデン
Stockholm
期間7/13/187/19/18

Fingerprint

Students

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

これを引用

Zhang, Y., Yahiro, K., Barrot, N., & Yokoo, M. (2018). Strategyproof and fair matching mechanism for union of symmetric m-convex constraints. : J. Lang (版), Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018 (pp. 590-596). (IJCAI International Joint Conference on Artificial Intelligence; 巻数 2018-July). International Joint Conferences on Artificial Intelligence.

Strategyproof and fair matching mechanism for union of symmetric m-convex constraints. / Zhang, Yuzhe; Yahiro, Kentaro; Barrot, Nathanaël; Yokoo, Makoto.

Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. 版 / Jerome Lang. International Joint Conferences on Artificial Intelligence, 2018. p. 590-596 (IJCAI International Joint Conference on Artificial Intelligence; 巻 2018-July).

研究成果: 著書/レポートタイプへの貢献会議での発言

Zhang, Y, Yahiro, K, Barrot, N & Yokoo, M 2018, Strategyproof and fair matching mechanism for union of symmetric m-convex constraints. : J Lang (版), Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. IJCAI International Joint Conference on Artificial Intelligence, 巻. 2018-July, International Joint Conferences on Artificial Intelligence, pp. 590-596, 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, スウェーデン, 7/13/18.
Zhang Y, Yahiro K, Barrot N, Yokoo M. Strategyproof and fair matching mechanism for union of symmetric m-convex constraints. : Lang J, 編集者, Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. International Joint Conferences on Artificial Intelligence. 2018. p. 590-596. (IJCAI International Joint Conference on Artificial Intelligence).
Zhang, Yuzhe ; Yahiro, Kentaro ; Barrot, Nathanaël ; Yokoo, Makoto. / Strategyproof and fair matching mechanism for union of symmetric m-convex constraints. Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. 編集者 / Jerome Lang. International Joint Conferences on Artificial Intelligence, 2018. pp. 590-596 (IJCAI International Joint Conference on Artificial Intelligence).
@inproceedings{616d3b251c0048bdb5a2d9bb5edf9790,
title = "Strategyproof and fair matching mechanism for union of symmetric m-convex constraints",
abstract = "In this paper, we identify a new class of distributional constraints defined as a union of symmetric M-convex sets, which can represent a variety of real-life constraints in two-sided matching settings. Since M-convexity is not closed under union, a union of symmetric M-convex sets does not belong to this well-behaved class of constraints in general. Thus, developing a fair and strategyproof mechanism that can handle this class is challenging. We present a novel mechanism called Quota Reduction Deferred Acceptance (QRDA), which repeatedly applies the standard DA mechanism by sequentially reducing artificially introduced maximum quotas. We show that QRDA is fair and strategyproof when handling a union of symmetric M-convex sets. Furthermore, in comparison to a baseline mechanism called Artificial Cap Deferred Acceptance (ACDA), QRDA always obtains a weakly better matching for students and, experimentally, performs better in terms of nonwastefulness.",
author = "Yuzhe Zhang and Kentaro Yahiro and Nathana{\"e}l Barrot and Makoto Yokoo",
year = "2018",
month = "1",
day = "1",
language = "English",
series = "IJCAI International Joint Conference on Artificial Intelligence",
publisher = "International Joint Conferences on Artificial Intelligence",
pages = "590--596",
editor = "Jerome Lang",
booktitle = "Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018",

}

TY - GEN

T1 - Strategyproof and fair matching mechanism for union of symmetric m-convex constraints

AU - Zhang, Yuzhe

AU - Yahiro, Kentaro

AU - Barrot, Nathanaël

AU - Yokoo, Makoto

PY - 2018/1/1

Y1 - 2018/1/1

N2 - In this paper, we identify a new class of distributional constraints defined as a union of symmetric M-convex sets, which can represent a variety of real-life constraints in two-sided matching settings. Since M-convexity is not closed under union, a union of symmetric M-convex sets does not belong to this well-behaved class of constraints in general. Thus, developing a fair and strategyproof mechanism that can handle this class is challenging. We present a novel mechanism called Quota Reduction Deferred Acceptance (QRDA), which repeatedly applies the standard DA mechanism by sequentially reducing artificially introduced maximum quotas. We show that QRDA is fair and strategyproof when handling a union of symmetric M-convex sets. Furthermore, in comparison to a baseline mechanism called Artificial Cap Deferred Acceptance (ACDA), QRDA always obtains a weakly better matching for students and, experimentally, performs better in terms of nonwastefulness.

AB - In this paper, we identify a new class of distributional constraints defined as a union of symmetric M-convex sets, which can represent a variety of real-life constraints in two-sided matching settings. Since M-convexity is not closed under union, a union of symmetric M-convex sets does not belong to this well-behaved class of constraints in general. Thus, developing a fair and strategyproof mechanism that can handle this class is challenging. We present a novel mechanism called Quota Reduction Deferred Acceptance (QRDA), which repeatedly applies the standard DA mechanism by sequentially reducing artificially introduced maximum quotas. We show that QRDA is fair and strategyproof when handling a union of symmetric M-convex sets. Furthermore, in comparison to a baseline mechanism called Artificial Cap Deferred Acceptance (ACDA), QRDA always obtains a weakly better matching for students and, experimentally, performs better in terms of nonwastefulness.

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

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

M3 - Conference contribution

AN - SCOPUS:85055706286

T3 - IJCAI International Joint Conference on Artificial Intelligence

SP - 590

EP - 596

BT - Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018

A2 - Lang, Jerome

PB - International Joint Conferences on Artificial Intelligence

ER -