Show simple item record

dc.contributor.authorLesca, Julien*
dc.contributor.authorFujita, Etsushi*
dc.contributor.authorSonoda, Akihisa*
dc.contributor.authorTodo, Taiki*
dc.contributor.authorYokoo, Makoto*
dc.date.accessioned2017-01-04T17:18:05Z
dc.date.available2017-01-04T17:18:05Z
dc.date.issued2015
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/16123
dc.language.isoenen
dc.subjectMechanism Design
dc.subjectExchange
dc.subjectTop-Trading-Cycles
dc.subjectCore
dc.subjectSplittings
dc.subjectComplexity
dc.subject.ddc003en
dc.subject.classificationjelC.C4.C44en
dc.titleA Complexity Approach for Core-Selecting Exchange with Multiple Indivisible Goods under Lexicographic Preferences
dc.typeCommunication / Conférence
dc.contributor.editoruniversityotherKyushu University
dc.description.abstractenCore-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.
dc.identifier.citationpages907-913
dc.relation.ispartoftitleProceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI’15)
dc.relation.ispartofpublnameAAAI Press
dc.relation.ispartofpublcityPalo Alto (USA)
dc.relation.ispartofdate2015
dc.contributor.countryeditoruniversityotherJAPAN
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.ispartofisbn978-1-57735-698-1
dc.relation.forthcomingnonen
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.date.updated2017-01-05T14:14:06Z
hal.person.labIds*
hal.person.labIds*
hal.person.labIds*
hal.person.labIds*
hal.person.labIds*
hal.identifierhal-01426702*


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record