TY - GEN

T1 - The role of a-priori information in networks of rational agents

AU - Afek, Yehuda

AU - Rafaeli, Shaked

AU - Sulamy, Moshe

N1 - Publisher Copyright:
© Yehuda Afek, Shaked Rafaeli, and Moshe Sulamy.

PY - 2018/10/1

Y1 - 2018/10/1

N2 - Until now, distributed algorithms for rational agents have assumed a-priori knowledge of n, the size of the network. This assumption is challenged here by proving how much a-priori knowledge is necessary for equilibrium in different distributed computing problems. Duplication – pretending to be more than one agent – is the main tool used by agents to deviate and increase their utility when not enough knowledge about n is given. We begin by proving that when no information on n is given, equilibrium is impossible for both Coloring and Knowledge Sharing. We then provide new algorithms for both problems when n is a-priori known to all agents. However, what if agents have partial knowledge about n? We provide tight upper and lower bounds that must be a-priori known on n for equilibrium to be possible in Leader Election, Knowledge Sharing, Coloring, Partition and Orientation.

AB - Until now, distributed algorithms for rational agents have assumed a-priori knowledge of n, the size of the network. This assumption is challenged here by proving how much a-priori knowledge is necessary for equilibrium in different distributed computing problems. Duplication – pretending to be more than one agent – is the main tool used by agents to deviate and increase their utility when not enough knowledge about n is given. We begin by proving that when no information on n is given, equilibrium is impossible for both Coloring and Knowledge Sharing. We then provide new algorithms for both problems when n is a-priori known to all agents. However, what if agents have partial knowledge about n? We provide tight upper and lower bounds that must be a-priori known on n for equilibrium to be possible in Leader Election, Knowledge Sharing, Coloring, Partition and Orientation.

KW - And phrases rational agents

KW - Coloring

KW - Distributed game theory

KW - Knowledge sharing

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

U2 - 10.4230/LIPIcs.DISC.2018.5

DO - 10.4230/LIPIcs.DISC.2018.5

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85059623535

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 32nd International Symposium on Distributed Computing, DISC 2018

A2 - Schmid, Ulrich

A2 - Widder, Josef

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 32nd International Symposium on Distributed Computing, DISC 2018

Y2 - 15 October 2018 through 19 October 2018

ER -