A Complexity Approach for Core-Selecting Exchange with Multiple Indivisible Goods under Lexicographic Preferences

Authors

  • Etsushi Fujita Kyushu University
  • Julien Lesca Paris Dauphine University
  • Akihisa Sonoda Kyushu University
  • Taiki Todo Kyushu University
  • Makoto Yokoo Kyushu University

DOI:

https://doi.org/10.1609/aaai.v29i1.9318

Keywords:

Mechanism Design, Exchange, Top-Trading-Cycles, Core, Splittings, Complexity

Abstract

Core-selection is a crucial property of social choice functions, or rules, in social choice literature. It is also desirable to address the incentive of agents to cheat by misreporting their preferences. This paper investigates an exchange problem where each agent may have multiple indivisible goods, agents' preferences over sets of goods are assumed to be lexicographic, and side payments are not allowed. We propose an exchange rule called augmented top-trading-cycles (ATTC) procedure based on the original TTC procedure. We first show that the ATTC procedure is core-selecting. We then show that finding a beneficial misreport under the ATTC procedure is NP-hard. Under the ATTC procedure, we finally clarify the relationship between preference misreport and splitting, which is a different type of manipulation.

Downloads

Published

2015-02-16

How to Cite

Fujita, E., Lesca, J., Sonoda, A., Todo, T., & Yokoo, M. (2015). A Complexity Approach for Core-Selecting Exchange with Multiple Indivisible Goods under Lexicographic Preferences. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1). https://doi.org/10.1609/aaai.v29i1.9318

Issue

Section

AAAI Technical Track: Game Theory and Economic Paradigms