Efficient allocation mechanism with endowments and distributional constraints

Takamasa Suzuki, Akihisa Tamura, Makoto Yokoo

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

Abstract

We consider an allocation problem of multiple types objects to agents, where each type of an object has multiple copies (e.g., mult iple seats of a school), each agent is endowed with an object, and some distributional constraints are imposed on the allocation (e.g., minimum/maximum quotas). We develop a mechanism that is based on the Top Trading Cycles mechanism, which Is strategy-proof, feasible (always satisfies distributional constraints). Pareto efficient, and individually rational, assuming the distributional constraints are represented as an M-convex set. The class of distributional cons traints we consider contains many situations raised from realistic matching problems, including individual minimum/maximum quot as, regional maximum quotas, type-specific quotas, and distance constraints. To the best of our knowledge, we are the first to develop a mechanism with these desirable properties.

Original languageEnglish
Title of host publication17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages50-67
Number of pages18
ISBN (Print)9781510868083
Publication statusPublished - Jan 1 2018
Event17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018 - Stockholm, Sweden
Duration: Jul 10 2018Jul 15 2018

Publication series

NameProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Volume1
ISSN (Print)1548-8403
ISSN (Electronic)1558-2914

Other

Other17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018
CountrySweden
CityStockholm
Period7/10/187/15/18

Fingerprint

Seats

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering

Cite this

Suzuki, T., Tamura, A., & Yokoo, M. (2018). Efficient allocation mechanism with endowments and distributional constraints. In 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018 (pp. 50-67). (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS; Vol. 1). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).

Efficient allocation mechanism with endowments and distributional constraints. / Suzuki, Takamasa; Tamura, Akihisa; Yokoo, Makoto.

17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2018. p. 50-67 (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS; Vol. 1).

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

Suzuki, T, Tamura, A & Yokoo, M 2018, Efficient allocation mechanism with endowments and distributional constraints. in 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, vol. 1, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), pp. 50-67, 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018, Stockholm, Sweden, 7/10/18.
Suzuki T, Tamura A, Yokoo M. Efficient allocation mechanism with endowments and distributional constraints. In 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). 2018. p. 50-67. (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS).
Suzuki, Takamasa ; Tamura, Akihisa ; Yokoo, Makoto. / Efficient allocation mechanism with endowments and distributional constraints. 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2018. pp. 50-67 (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS).
@inproceedings{c1f48e9c042141949848dcb83278a0cb,
title = "Efficient allocation mechanism with endowments and distributional constraints",
abstract = "We consider an allocation problem of multiple types objects to agents, where each type of an object has multiple copies (e.g., mult iple seats of a school), each agent is endowed with an object, and some distributional constraints are imposed on the allocation (e.g., minimum/maximum quotas). We develop a mechanism that is based on the Top Trading Cycles mechanism, which Is strategy-proof, feasible (always satisfies distributional constraints). Pareto efficient, and individually rational, assuming the distributional constraints are represented as an M-convex set. The class of distributional cons traints we consider contains many situations raised from realistic matching problems, including individual minimum/maximum quot as, regional maximum quotas, type-specific quotas, and distance constraints. To the best of our knowledge, we are the first to develop a mechanism with these desirable properties.",
author = "Takamasa Suzuki and Akihisa Tamura and Makoto Yokoo",
year = "2018",
month = "1",
day = "1",
language = "English",
isbn = "9781510868083",
series = "Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS",
publisher = "International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)",
pages = "50--67",
booktitle = "17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018",

}

TY - GEN

T1 - Efficient allocation mechanism with endowments and distributional constraints

AU - Suzuki, Takamasa

AU - Tamura, Akihisa

AU - Yokoo, Makoto

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We consider an allocation problem of multiple types objects to agents, where each type of an object has multiple copies (e.g., mult iple seats of a school), each agent is endowed with an object, and some distributional constraints are imposed on the allocation (e.g., minimum/maximum quotas). We develop a mechanism that is based on the Top Trading Cycles mechanism, which Is strategy-proof, feasible (always satisfies distributional constraints). Pareto efficient, and individually rational, assuming the distributional constraints are represented as an M-convex set. The class of distributional cons traints we consider contains many situations raised from realistic matching problems, including individual minimum/maximum quot as, regional maximum quotas, type-specific quotas, and distance constraints. To the best of our knowledge, we are the first to develop a mechanism with these desirable properties.

AB - We consider an allocation problem of multiple types objects to agents, where each type of an object has multiple copies (e.g., mult iple seats of a school), each agent is endowed with an object, and some distributional constraints are imposed on the allocation (e.g., minimum/maximum quotas). We develop a mechanism that is based on the Top Trading Cycles mechanism, which Is strategy-proof, feasible (always satisfies distributional constraints). Pareto efficient, and individually rational, assuming the distributional constraints are represented as an M-convex set. The class of distributional cons traints we consider contains many situations raised from realistic matching problems, including individual minimum/maximum quot as, regional maximum quotas, type-specific quotas, and distance constraints. To the best of our knowledge, we are the first to develop a mechanism with these desirable properties.

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

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

M3 - Conference contribution

AN - SCOPUS:85055325446

SN - 9781510868083

T3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

SP - 50

EP - 67

BT - 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018

PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)

ER -