 Coalitional Manipulation on Communication NetworkNo 563, Econometric Society 2004 Far Eastern Meetings from Econometric Society Abstract: In an abstract model of division problems, we study division rules that are not manipulable through a reallocation of individual characteristic vectors within a coalition (e.g. reallocation of claims in bankruptcy problems). A coalition can be formed if members of the coalition are connected on a communication network, or a graph. We offer a characterization of non-manipulable division rules without any assumption on the structure of communication network. As corollaries, we obtain a number of earlier characterization results established with the assumption of complete network (complete graph) in various specialized settings. Moreover, our characterization, as we show, can be quite different from the earlier results depending on the network structure: for example, when the network is a tree, much larger family of rules are shown to be non-manipulable. The abstract model we consider can have various special examples such as bankruptcy problems, surplus sharing problems, cost sharing problems, social choice with transferable utility, etc Keywords: Division problem; Coalitional manipulation; Non-manipulability; Reallocation-proofness; Non-bossiness; Network (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ecm:feam04:563 Access Statistics for this paper More papers in Econometric Society 2004 Far Eastern Meetings from Econometric Society Contact information at EDIRC. |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to econpapers@oru.se.
EconPapers is hosted by the
School of Business at Örebro University.