A Complexity Approach for Core-Selecting Exchange with Multiple Indivisible Goods under Lexicographic Preferences
Lesca, Julien; Fujita, Etsushi; Sonoda, Akihisa; Todo, Taiki; Yokoo, Makoto (2015), A Complexity Approach for Core-Selecting Exchange with Multiple Indivisible Goods under Lexicographic Preferences, Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI’15), AAAI Press : Palo Alto (USA), p. 907-913
TypeCommunication / Conférence
Titre de l'ouvrageProceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI’15)
MétadonnéesAfficher la notice complète
Résumé (EN)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.
Mots-clésMechanism Design; Exchange; Top-Trading-Cycles; Core; Splittings; Complexity
Affichage des éléments liés par titre et auteur.
Fujita, Etsushi; Lesca, Julien; Sonoda, Akihisa; Todo, Taiki; Yokoo, Makoto (2018) Article accepté pour publication ou publié