+ All Categories
Home > Technology > Efficient opinion sharing in large decentralised teams

Efficient opinion sharing in large decentralised teams

Date post: 05-Dec-2014
Category:
Upload: oleksandr-pryymak
View: 1,045 times
Download: 2 times
Share this document with a friend
Description:
This is a version without animation of the system dynamics, unfortunately it is not supported by any on-line tools. Presented on AAMAS-12
28
Efficient Opinion Sharing in Large Decentralised Teams Oleksandr Pryymak, Alex Rogers and Nicholas R. Jennings {op08r,acr,nrj}@ecs.soton.ac.uk University of Southampton Agents, Interaction and Complexity Group 6 June 2012 AAMAS'12
Transcript
Page 1: Efficient opinion sharing in large decentralised teams

Efficient Opinion Sharingin Large Decentralised Teams

Oleksandr Pryymak, Alex Rogers and Nicholas R. Jennings{op08r,acr,nrj}@ecs.soton.ac.uk

University of SouthamptonAgents, Interaction andComplexity Group

6 June 2012AAMAS'12

Page 2: Efficient opinion sharing in large decentralised teams

Disaster response and Large Decentralised Teams

2010, Haiti earthquake

Citizen and public news reporting (Ushahidi)

2010, Chile earthquake

"Twitter is one of the speediest, albeit not the most accurate, sources of real-time information" France24

Page 3: Efficient opinion sharing in large decentralised teams

Disaster response and Large Decentralised Teams

Teams are large Decentralised Few opinion sources Observations are uncertain and conflicting Agents share only opinions without supporting information (Communication is strictly limited)

Opinion is a subjective belief about the common subject of

interest

Page 4: Efficient opinion sharing in large decentralised teams

Challenge

How to improve the accuracy of shared

opinions?

Page 5: Efficient opinion sharing in large decentralised teams

Opinion Sharing Model Networked team

Opinions are introduced gradually

Noisy

Weights (levels of importance) define sharing process

Page 6: Efficient opinion sharing in large decentralised teams

Agents' model

Page 7: Efficient opinion sharing in large decentralised teams

Agents' model

Page 8: Efficient opinion sharing in large decentralised teams

Agents' model

Page 9: Efficient opinion sharing in large decentralised teams

Dynamics of the Opinion Sharing

Stable Transition Unstable

Page 10: Efficient opinion sharing in large decentralised teams

Stable Dynamics

Page 11: Efficient opinion sharing in large decentralised teams

Unstable Dynamics

Page 12: Efficient opinion sharing in large decentralised teams

Transition

Page 13: Efficient opinion sharing in large decentralised teams

Dynamics of the Opinion Sharing

Page 14: Efficient opinion sharing in large decentralised teams

Problem How to find the settings for improved reliability?

Requirements: Decentralised On-line Adaptive (i.e. complex topology, size, degree) Minimise communication

DACOR algorithm Distributed Adaptive Communication for Overall Reliability by R. Glinton, P. Scerri, and K. Sycara

introduces excessive communication overhead (#neighbours2)

exhibits low adaptivity (3 parameters to tune)

Page 15: Efficient opinion sharing in large decentralised teams

Autonomous Adaptive Tuning (AAT)

Finds tcritical

for each agent individually

Each agent must use the minimal importance level

that still enables it to form its opinion

Page 16: Efficient opinion sharing in large decentralised teams

AAT: sample run

Page 17: Efficient opinion sharing in large decentralised teams

AAT: stages

Executes 3 stages by each agent:

Select candidate importance levels

Estimate the awareness rates they deliver

Select the best one to use

However, the agent's choice highly influences others

Page 18: Efficient opinion sharing in large decentralised teams

AAT: Candidate Importance Levels

This stage limits the search space.

Initialise an agent once with candidates:

drawn from the range with a given step size. However,

the algorithm becomes computationally expensive

that lead to opinion formation on different update steps. Thus, the agent exhibits different dynamics.

Page 19: Efficient opinion sharing in large decentralised teams

AAT:Estimation of the Awareness Rates

Awareness Rate is a probability of forming an opinion with a given importance level.

2 evidences indicate that agent could have formed an opinion with a given candidate:

If an opinion was formed, then all higher levels would have led to opinion formation

Otherwise, a candidate requires less updates to form an opinion than was observed

Page 20: Efficient opinion sharing in large decentralised teams

AAT:Strategy to Choose an Importance Level

Since an agent's choice influences others, strategies with less dramatic changes to the dynamics perform better

Hill-climbing: Select the importance level which is closest to the currently used

(with the awareness rate closest to the target)

Outperforms popular MAB strategies.

Page 21: Efficient opinion sharing in large decentralised teams

Results: Target Awareness Rate

Compromise awareness for overall Reliability

Page 22: Efficient opinion sharing in large decentralised teams

Results: Target Awareness Rate

Compromise awareness for overall Reliability

Page 23: Efficient opinion sharing in large decentralised teams

Results: Reliability and Convergence

Random Network

Page 24: Efficient opinion sharing in large decentralised teams

Results: Reliability and Convergence

Scale-free Network

Page 25: Efficient opinion sharing in large decentralised teams

Results: Reliability and Convergence

Small-world Network

Page 26: Efficient opinion sharing in large decentralised teams

Results: Communication Expenses

Minimal Communication = #messages to share an opinion in a single cascade (total #neighbours)

Page 27: Efficient opinion sharing in large decentralised teams

Results: Indifferent AgentsWhat if some of the agents cannot alter their weights?

Page 28: Efficient opinion sharing in large decentralised teams

Summary

Presented a novel algorithm, AAT, that:

improves the reliability of the opinions outperforms the existing algorithm, DACOR, and prediction of

the best setting (Av.Pre-tuned) the first that minimises communication to opinion sharing only Computationally inexpensive Adaptive, scalable and robust to the presence of indifferent

agents Operates without a knowledge of the context and the ground truth

What to take away?


Recommended