### Abstract

Coalition formation is an important capability for automated negotiation among self-interested agents. In order for coalitions to be stable, a key question that must be answered is how the gains from cooperation are to be distributed. Coalitional game theory provides a number of solution concepts for this. However, recent research has revealed that these traditional solution concepts are vulnerable to various manipulations in open anonymous environments such as the Internet. To address this, previous work has developed a solution concept called the anonymity-proof core, which is robust against such manipulations. That work also developed a method for compactly representing the anonymity-proof core. However, the required computational and representational costs are still huge. In this paper, we develop a new solution concept which we call the anonymity-proof Shapley value. We show that the anonymity-proof Shapley value is characterized by certain simple axiomatic conditions, always exists, and is uniquely determined. The computational and representational costs of the anonymity-proof Shapley value are drastically smaller than those of existing anonymity-proof solution concepts.

Original language | English |
---|---|

Pages (from-to) | 181-196 |

Number of pages | 16 |

Journal | Computer Software |

Volume | 26 |

Issue number | 4 |

Publication status | Published - Dec 1 2009 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software

### Cite this

*Computer Software*,

*26*(4), 181-196.

**Anonymity-proof shapley value : Compact and computationally efficient solution concept for coalitional games in open anonymous environment.** / Ohta, Naoki; Sato, Yasufumi; Iwasaki, Atsushi; Yokoo, Makoto; Conitzer, Vincent.

Research output: Contribution to journal › Article

*Computer Software*, vol. 26, no. 4, pp. 181-196.

}

TY - JOUR

T1 - Anonymity-proof shapley value

T2 - Compact and computationally efficient solution concept for coalitional games in open anonymous environment

AU - Ohta, Naoki

AU - Sato, Yasufumi

AU - Iwasaki, Atsushi

AU - Yokoo, Makoto

AU - Conitzer, Vincent

PY - 2009/12/1

Y1 - 2009/12/1

N2 - Coalition formation is an important capability for automated negotiation among self-interested agents. In order for coalitions to be stable, a key question that must be answered is how the gains from cooperation are to be distributed. Coalitional game theory provides a number of solution concepts for this. However, recent research has revealed that these traditional solution concepts are vulnerable to various manipulations in open anonymous environments such as the Internet. To address this, previous work has developed a solution concept called the anonymity-proof core, which is robust against such manipulations. That work also developed a method for compactly representing the anonymity-proof core. However, the required computational and representational costs are still huge. In this paper, we develop a new solution concept which we call the anonymity-proof Shapley value. We show that the anonymity-proof Shapley value is characterized by certain simple axiomatic conditions, always exists, and is uniquely determined. The computational and representational costs of the anonymity-proof Shapley value are drastically smaller than those of existing anonymity-proof solution concepts.

AB - Coalition formation is an important capability for automated negotiation among self-interested agents. In order for coalitions to be stable, a key question that must be answered is how the gains from cooperation are to be distributed. Coalitional game theory provides a number of solution concepts for this. However, recent research has revealed that these traditional solution concepts are vulnerable to various manipulations in open anonymous environments such as the Internet. To address this, previous work has developed a solution concept called the anonymity-proof core, which is robust against such manipulations. That work also developed a method for compactly representing the anonymity-proof core. However, the required computational and representational costs are still huge. In this paper, we develop a new solution concept which we call the anonymity-proof Shapley value. We show that the anonymity-proof Shapley value is characterized by certain simple axiomatic conditions, always exists, and is uniquely determined. The computational and representational costs of the anonymity-proof Shapley value are drastically smaller than those of existing anonymity-proof solution concepts.

UR - http://www.scopus.com/inward/record.url?scp=73449110148&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=73449110148&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:73449110148

VL - 26

SP - 181

EP - 196

JO - Computer Software

JF - Computer Software

SN - 0289-6540

IS - 4

ER -