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

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

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

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.

Original languageEnglish
Title of host publicationProceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018
EditorsJerome Lang
PublisherInternational Joint Conferences on Artificial Intelligence
Pages590-596
Number of pages7
ISBN (Electronic)9780999241127
Publication statusPublished - Jan 1 2018
Event27th International Joint Conference on Artificial Intelligence, IJCAI 2018 - Stockholm, Sweden
Duration: Jul 13 2018Jul 19 2018

Publication series

NameIJCAI International Joint Conference on Artificial Intelligence
Volume2018-July
ISSN (Print)1045-0823

Other

Other27th International Joint Conference on Artificial Intelligence, IJCAI 2018
CountrySweden
CityStockholm
Period7/13/187/19/18

Fingerprint

Students

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Zhang, Y., Yahiro, K., Barrot, N., & Yokoo, M. (2018). Strategyproof and fair matching mechanism for union of symmetric m-convex constraints. In J. Lang (Ed.), Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018 (pp. 590-596). (IJCAI International Joint Conference on Artificial Intelligence; Vol. 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. ed. / Jerome Lang. International Joint Conferences on Artificial Intelligence, 2018. p. 590-596 (IJCAI International Joint Conference on Artificial Intelligence; Vol. 2018-July).

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

Zhang, Y, Yahiro, K, Barrot, N & Yokoo, M 2018, Strategyproof and fair matching mechanism for union of symmetric m-convex constraints. in J Lang (ed.), Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. IJCAI International Joint Conference on Artificial Intelligence, vol. 2018-July, International Joint Conferences on Artificial Intelligence, pp. 590-596, 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, 7/13/18.
Zhang Y, Yahiro K, Barrot N, Yokoo M. Strategyproof and fair matching mechanism for union of symmetric m-convex constraints. In Lang J, editor, 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. editor / 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 -