TY - GEN
T1 - Strategyproof exchange with multiple private endowments
AU - Todo, Taiki
AU - Sun, Haixin
AU - Yokoo, Makoto
N1 - Publisher Copyright:
Copyright © 2014, Association for the Advancement of Artificial Intelligence.
PY - 2014
Y1 - 2014
N2 - We study a mechanism design problem for exchange economies where each agent is initially endowed with a set of indivisible goods and side payments arc not allowed. We assume each agent can withhold some endowments. as well as misreport her preference. Under this assumption, strategyproofness requires that for each agent, reporting her true preference with revealing all her endowments is a dominant strategy, and thus implies individual rationality. Our objective in this paper is to analyze the effect of such private ownership in exchange economies with multiple endowments. As fundamental results, we first show that the revelation principle holds under a natural assumption and that strategyproofness and Pareto efficiency are incompatible even under the lexicographic preference domain. We then propose a class of exchange rules, each of which has a corresponding directed graph to prescribe possible trades, and provide necessary and sufficient conditions on the graph structure so that they satisfy strategyproofness.
AB - We study a mechanism design problem for exchange economies where each agent is initially endowed with a set of indivisible goods and side payments arc not allowed. We assume each agent can withhold some endowments. as well as misreport her preference. Under this assumption, strategyproofness requires that for each agent, reporting her true preference with revealing all her endowments is a dominant strategy, and thus implies individual rationality. Our objective in this paper is to analyze the effect of such private ownership in exchange economies with multiple endowments. As fundamental results, we first show that the revelation principle holds under a natural assumption and that strategyproofness and Pareto efficiency are incompatible even under the lexicographic preference domain. We then propose a class of exchange rules, each of which has a corresponding directed graph to prescribe possible trades, and provide necessary and sufficient conditions on the graph structure so that they satisfy strategyproofness.
UR - http://www.scopus.com/inward/record.url?scp=84908207731&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84908207731&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84908207731
T3 - Proceedings of the National Conference on Artificial Intelligence
SP - 805
EP - 811
BT - Proceedings of the 28th AAAI Conference on Artificial Intelligence and the 26th Innovative Applications of Artificial Intelligence Conference and the 5th Symposium on Educational Advances in Artificial Intelligence
PB - AI Access Foundation
T2 - 28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014
Y2 - 27 July 2014 through 31 July 2014
ER -