The University of Southampton
University of Southampton Institutional Repository

Trusted kernel-based coalition formation

Trusted kernel-based coalition formation
Trusted kernel-based coalition formation
We define Trusted Kernel-based Coalition Formation as a novel extension to the traditional kernel-based coalition formation process which ensures agents choose the most reliable coalition partners and are guaranteed to obtain the payment they deserve. To this end, we develop an encryption-based communication protocol and a payment scheme which ensure that agents cannot manipulate the mechanism to their own benefit. Moreover, we integrate a generic trust model in the coalition formation process that permits the selection of the most reliable agents over repeated coalition games. We empirically evaluate our mechanism when iterated and show that, in the long run, it always chooses the coalition structure that has the maximum expected value and determines the payoffs that match their level of reliability.
989-996
Blankenburg, B.
32a63448-33f1-4c71-b581-dad2aa9dbba6
Dash, R.K.
688bf118-f42f-42bc-80f7-e915330f85d5
Ramchurn, S.D.
1d62ae2a-a498-444e-912d-a6082d3aaea3
Klusch, M.
335b3c7a-9960-46a5-919f-96a8627d7505
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Blankenburg, B.
32a63448-33f1-4c71-b581-dad2aa9dbba6
Dash, R.K.
688bf118-f42f-42bc-80f7-e915330f85d5
Ramchurn, S.D.
1d62ae2a-a498-444e-912d-a6082d3aaea3
Klusch, M.
335b3c7a-9960-46a5-919f-96a8627d7505
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30

Blankenburg, B., Dash, R.K., Ramchurn, S.D., Klusch, M. and Jennings, N. R. (2005) Trusted kernel-based coalition formation. Proc. 4th Int Joint Conf on Autonomous Agents and Multi-Agent Systems, Netherlands. pp. 989-996 .

Record type: Conference or Workshop Item (Paper)

Abstract

We define Trusted Kernel-based Coalition Formation as a novel extension to the traditional kernel-based coalition formation process which ensures agents choose the most reliable coalition partners and are guaranteed to obtain the payment they deserve. To this end, we develop an encryption-based communication protocol and a payment scheme which ensure that agents cannot manipulate the mechanism to their own benefit. Moreover, we integrate a generic trust model in the coalition formation process that permits the selection of the most reliable agents over repeated coalition games. We empirically evaluate our mechanism when iterated and show that, in the long run, it always chooses the coalition structure that has the maximum expected value and determines the payoffs that match their level of reliability.

PDF
bastian-aamas05.pdf - Other
Download (311kB)

More information

Published date: 2005
Venue - Dates: Proc. 4th Int Joint Conf on Autonomous Agents and Multi-Agent Systems, Netherlands, 2005-01-01
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 260808
URI: https://eprints.soton.ac.uk/id/eprint/260808
PURE UUID: 62d00224-05c5-48fd-8c06-e1eb6215e08b
ORCID for S.D. Ramchurn: ORCID iD orcid.org/0000-0001-9686-4302

Catalogue record

Date deposited: 29 Apr 2005
Last modified: 06 Jun 2018 12:42

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×