SlideShare une entreprise Scribd logo
1  sur  22
Télécharger pour lire hors ligne
Outline               System Model                 Cooperation Mechanisms          Results   Conclusions




                          Mechanisms to promote cooperation
                               in decentralized services

                                E. del Val            M. Rebollo            V. Botti

                                      Univ. Politecnica de Valencia (Spain)


                                                EUMAS ’12
                                           Dublin, December 2012




M. Rebollo et al. (UPV)                                                                      EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




Promoting Cooperation



          Motivation
          There are scenarios in decentralized systems in which cooperation
          plays a central role

               agents connected in networks
               bounded rationality
               heterogeneous, self-interested agents




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




Our Proposal


          The challenge
          Obtain an emergent, cooperative global behavior even when
          cooperators are a minority, from local decisions.

          What is done. . .
               a network structure that ensures navigation and efficiency
               structural changes to isolate undesired agents
               incentives to promote cooperation




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




Outline


          1 Outline


          2 System Model


          3 Cooperation Mechanisms


          4 Results


          5 Conclusions



M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




System Model




          Definition (Open Service-Oriented MAS)
          (A, L), where A = {ai , ..., an } is a finite set of autonomous agents
          that are part of the system, and L ⊆ A × A is the set of links,
          where each link (ai , aj ) ∈ L




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




System Model
          Definition (Agent)
          is a tuple (Si , Ni , sti ) where:
               Si = {s1 , . . . , sl } is the set of semantic service descriptions of
               the services provided by the agent (WSDL);
               Ni is the set of neighbors of the agent,
               Ni ⊆ A − {ai } : ∀aj ∈ Ni , ∃(ai , aj ) ∈ L, and |Ni | > 0. It is
               assumed that |Ni |    |A|;
               sti is the internal state of the agent.
               πi : sti → Ni is the neighbor selection function that
               determines the most promising neighbor to provide a service;
               ρi : sti → Ψ is the adaptation selection function where Ψ is
               the set of finite adaptation actions of the agent.
M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




Network Creation


               probabilistic relations baed on homophily (assortativity,
               similarity)
               two agents are similar if they provide similar services

                                            H = αHv + (1 − α)Hs

               growing network structure (exponential degree distribution)
               certain characteristics of a small-world network (short paths,
               clustering)



M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms         Results       Conclusions




Service Discovery

               navigation problem in networks (it relies in the agent
               cooperation)
               hill climbing (greedy) method
                                                                                 |Nj | 
                                                                                           
                                                                   H(aj , at )  
                  π(at ) = argmax 1 − 1 − 
                                                                                   
                                                                                     
                                                                        H(an , at )  
                                   
                            aj ∈Ni        
                                                                  an ∈Ni


               agents pass the query until the desire service is found
               it is a problem with self–interested agents

M. Rebollo et al. (UPV)                                                                         EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms         Results          Conclusions




Social Plasticity


                                                                        capacity to change
                                                                        relations as times passes
                                                                        link utility decays with
                                                                        time
                                                                        depends on the queries aj
                                                                        forwards
                                                                                         1
                                                                            D(aj ) =   1+e −γ




M. Rebollo et al. (UPV)                                                                            EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




Social Plasticity



               when an agent breaks a link, a substitute must be found
               (maintain the network structure)
               criteria
                       neighbor of neighbor
                       a similar agent to the previous one
               rewire links has not a cost




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




Social Plasticity




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




Social Plasticity




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




Incentives




               each action implies a cost (ask for a service and forward)
               a reward is obtained if the service is found
               rewards are provided by the system
               agents imitated the strategy of successful neighbors




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




Incentives




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




Combining social plasticity and incentives


               Both strategies promote cooperation in general
               but it is not enough if non–cooperative agents has a high
               degree
                       network broken in isolated parts
                       rewire cost –> not affordable for some agents
                       payoff not enough to promote cooperation
               the combined model
                  1    incentives to change the behavior of non–cooperatives
                  2    rewire links if it fails




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




Experiment Design
          Configuration

               1,000 agents, 10 different networks
               100 steps to forward a query, snapshots after 5,000 queries
               varying the initial prop. of collaborators

          Strategies

               Social plasticity (SP)
               Incentives
               Reinforcement Learning (RL) using WOLF
               Game-theory approach, using Prisoner’s Dilemma (PD)
               Incentives + Social Plasticity (I+SP)
M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




Measures




               proportion of collaborator / non–collaborators
               average path length (better if smaller)
               search failures due to non–collaboration
               search success (including TTL)




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




60% of collaborators (num and path length)




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




40% of collaborators (num and path length)




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




60% of collaborators (failures and success)




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




40% of collaborators (failures and success)




M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services
Outline               System Model                 Cooperation Mechanisms   Results   Conclusions




Conclusions


               improving cooperation to solve navigation problem in networks
               applied to decentralized service management
               combination of structural changes and incentives
               improves the performance when non-collaborators are
               ’important’ in the network
               works by imitation: a core of collaborators is needed
               a guess: the size of the core depends on network
               characteristics (percolation, efficience, centrality coefficient)



M. Rebollo et al. (UPV)                                                               EUMAS’12
Mechanisms to promote cooperation in decentralized services

Contenu connexe

Similaire à Mechanisms to Promote Cooperation in Decentralized Services

Group Selection Grid AWeSoMe07
Group Selection Grid AWeSoMe07Group Selection Grid AWeSoMe07
Group Selection Grid AWeSoMe07guest078724
 
Pak eko 4412ijdms01
Pak eko 4412ijdms01Pak eko 4412ijdms01
Pak eko 4412ijdms01hyuviridvic
 
Genetic Approach to Parallel Scheduling
Genetic Approach to Parallel SchedulingGenetic Approach to Parallel Scheduling
Genetic Approach to Parallel SchedulingIOSR Journals
 
International Journal of Business and Management Invention (IJBMI)
International Journal of Business and Management Invention (IJBMI)International Journal of Business and Management Invention (IJBMI)
International Journal of Business and Management Invention (IJBMI)inventionjournals
 
Reliable payment gateway.pdf
Reliable payment gateway.pdfReliable payment gateway.pdf
Reliable payment gateway.pdfsam26a
 
Using fuzzy set qualitative comparative analysis to measure contract rules in...
Using fuzzy set qualitative comparative analysis to measure contract rules in...Using fuzzy set qualitative comparative analysis to measure contract rules in...
Using fuzzy set qualitative comparative analysis to measure contract rules in...Maria Kapsali (PhD)
 
A Convex Hull Formulation for the Design of Optimal Mixtures.pdf
A Convex Hull Formulation for the Design of Optimal Mixtures.pdfA Convex Hull Formulation for the Design of Optimal Mixtures.pdf
A Convex Hull Formulation for the Design of Optimal Mixtures.pdfChristine Maffla
 
A PNML extension for the HCI design
A PNML extension for the HCI designA PNML extension for the HCI design
A PNML extension for the HCI designWaqas Tariq
 
Linking data, models and tools an overview
Linking data, models and tools an overviewLinking data, models and tools an overview
Linking data, models and tools an overviewGennadii Donchyts
 
Conceptual Modeling for Control of a Physical Engineering Plant: A Case Study
Conceptual Modeling for Control of a Physical Engineering Plant: A Case Study Conceptual Modeling for Control of a Physical Engineering Plant: A Case Study
Conceptual Modeling for Control of a Physical Engineering Plant: A Case Study IJCSIS Research Publications
 
A SYSTEM OF SERIAL COMPUTATION FOR CLASSIFIED RULES PREDICTION IN NONREGULAR ...
A SYSTEM OF SERIAL COMPUTATION FOR CLASSIFIED RULES PREDICTION IN NONREGULAR ...A SYSTEM OF SERIAL COMPUTATION FOR CLASSIFIED RULES PREDICTION IN NONREGULAR ...
A SYSTEM OF SERIAL COMPUTATION FOR CLASSIFIED RULES PREDICTION IN NONREGULAR ...ijaia
 
An Implementation on Effective Robot Mission under Critical Environemental Co...
An Implementation on Effective Robot Mission under Critical Environemental Co...An Implementation on Effective Robot Mission under Critical Environemental Co...
An Implementation on Effective Robot Mission under Critical Environemental Co...IJERA Editor
 
An Ensemble Approach To Improve Homomorphic Encrypted Data Classification Per...
An Ensemble Approach To Improve Homomorphic Encrypted Data Classification Per...An Ensemble Approach To Improve Homomorphic Encrypted Data Classification Per...
An Ensemble Approach To Improve Homomorphic Encrypted Data Classification Per...IJCI JOURNAL
 
Collaborative performance
Collaborative performanceCollaborative performance
Collaborative performanceNeeraj Jaiswal
 
T OWARDS A S YSTEM D YNAMICS M ODELING M E- THOD B ASED ON DEMATEL
T OWARDS A  S YSTEM  D YNAMICS  M ODELING  M E- THOD B ASED ON  DEMATELT OWARDS A  S YSTEM  D YNAMICS  M ODELING  M E- THOD B ASED ON  DEMATEL
T OWARDS A S YSTEM D YNAMICS M ODELING M E- THOD B ASED ON DEMATELijcsit
 
Analyzing And Predicting Focus Of Attention In Remote Collaborative Tasks
Analyzing And Predicting Focus Of Attention In Remote Collaborative TasksAnalyzing And Predicting Focus Of Attention In Remote Collaborative Tasks
Analyzing And Predicting Focus Of Attention In Remote Collaborative TasksKayla Smith
 
FAST FUZZY FEATURE CLUSTERING FOR TEXT CLASSIFICATION
FAST FUZZY FEATURE CLUSTERING FOR TEXT CLASSIFICATION FAST FUZZY FEATURE CLUSTERING FOR TEXT CLASSIFICATION
FAST FUZZY FEATURE CLUSTERING FOR TEXT CLASSIFICATION cscpconf
 

Similaire à Mechanisms to Promote Cooperation in Decentralized Services (20)

Group Selection Grid AWeSoMe07
Group Selection Grid AWeSoMe07Group Selection Grid AWeSoMe07
Group Selection Grid AWeSoMe07
 
Pak eko 4412ijdms01
Pak eko 4412ijdms01Pak eko 4412ijdms01
Pak eko 4412ijdms01
 
Genetic Approach to Parallel Scheduling
Genetic Approach to Parallel SchedulingGenetic Approach to Parallel Scheduling
Genetic Approach to Parallel Scheduling
 
International Journal of Business and Management Invention (IJBMI)
International Journal of Business and Management Invention (IJBMI)International Journal of Business and Management Invention (IJBMI)
International Journal of Business and Management Invention (IJBMI)
 
Model Integration
Model IntegrationModel Integration
Model Integration
 
Reliable payment gateway.pdf
Reliable payment gateway.pdfReliable payment gateway.pdf
Reliable payment gateway.pdf
 
Using fuzzy set qualitative comparative analysis to measure contract rules in...
Using fuzzy set qualitative comparative analysis to measure contract rules in...Using fuzzy set qualitative comparative analysis to measure contract rules in...
Using fuzzy set qualitative comparative analysis to measure contract rules in...
 
A Convex Hull Formulation for the Design of Optimal Mixtures.pdf
A Convex Hull Formulation for the Design of Optimal Mixtures.pdfA Convex Hull Formulation for the Design of Optimal Mixtures.pdf
A Convex Hull Formulation for the Design of Optimal Mixtures.pdf
 
A PNML extension for the HCI design
A PNML extension for the HCI designA PNML extension for the HCI design
A PNML extension for the HCI design
 
Linking data, models and tools an overview
Linking data, models and tools an overviewLinking data, models and tools an overview
Linking data, models and tools an overview
 
Conceptual Modeling for Control of a Physical Engineering Plant: A Case Study
Conceptual Modeling for Control of a Physical Engineering Plant: A Case Study Conceptual Modeling for Control of a Physical Engineering Plant: A Case Study
Conceptual Modeling for Control of a Physical Engineering Plant: A Case Study
 
A SYSTEM OF SERIAL COMPUTATION FOR CLASSIFIED RULES PREDICTION IN NONREGULAR ...
A SYSTEM OF SERIAL COMPUTATION FOR CLASSIFIED RULES PREDICTION IN NONREGULAR ...A SYSTEM OF SERIAL COMPUTATION FOR CLASSIFIED RULES PREDICTION IN NONREGULAR ...
A SYSTEM OF SERIAL COMPUTATION FOR CLASSIFIED RULES PREDICTION IN NONREGULAR ...
 
An Implementation on Effective Robot Mission under Critical Environemental Co...
An Implementation on Effective Robot Mission under Critical Environemental Co...An Implementation on Effective Robot Mission under Critical Environemental Co...
An Implementation on Effective Robot Mission under Critical Environemental Co...
 
An Ensemble Approach To Improve Homomorphic Encrypted Data Classification Per...
An Ensemble Approach To Improve Homomorphic Encrypted Data Classification Per...An Ensemble Approach To Improve Homomorphic Encrypted Data Classification Per...
An Ensemble Approach To Improve Homomorphic Encrypted Data Classification Per...
 
Collaborative performance
Collaborative performanceCollaborative performance
Collaborative performance
 
B0450108026
B0450108026B0450108026
B0450108026
 
LatentCross.pdf
LatentCross.pdfLatentCross.pdf
LatentCross.pdf
 
T OWARDS A S YSTEM D YNAMICS M ODELING M E- THOD B ASED ON DEMATEL
T OWARDS A  S YSTEM  D YNAMICS  M ODELING  M E- THOD B ASED ON  DEMATELT OWARDS A  S YSTEM  D YNAMICS  M ODELING  M E- THOD B ASED ON  DEMATEL
T OWARDS A S YSTEM D YNAMICS M ODELING M E- THOD B ASED ON DEMATEL
 
Analyzing And Predicting Focus Of Attention In Remote Collaborative Tasks
Analyzing And Predicting Focus Of Attention In Remote Collaborative TasksAnalyzing And Predicting Focus Of Attention In Remote Collaborative Tasks
Analyzing And Predicting Focus Of Attention In Remote Collaborative Tasks
 
FAST FUZZY FEATURE CLUSTERING FOR TEXT CLASSIFICATION
FAST FUZZY FEATURE CLUSTERING FOR TEXT CLASSIFICATION FAST FUZZY FEATURE CLUSTERING FOR TEXT CLASSIFICATION
FAST FUZZY FEATURE CLUSTERING FOR TEXT CLASSIFICATION
 

Plus de Miguel Rebollo

GTG-CoL: A Decentralized Federated Learning Based on Consensus for Dynamic N...
 GTG-CoL: A Decentralized Federated Learning Based on Consensus for Dynamic N... GTG-CoL: A Decentralized Federated Learning Based on Consensus for Dynamic N...
GTG-CoL: A Decentralized Federated Learning Based on Consensus for Dynamic N...Miguel Rebollo
 
Co-Learning: Consensus-based Learning for Multi-Agent Systems
 Co-Learning: Consensus-based Learning for Multi-Agent Systems Co-Learning: Consensus-based Learning for Multi-Agent Systems
Co-Learning: Consensus-based Learning for Multi-Agent SystemsMiguel Rebollo
 
Análisis de la red de autores de ciencia ficción de Clarkesworld
Análisis de la red de autores de ciencia ficción de ClarkesworldAnálisis de la red de autores de ciencia ficción de Clarkesworld
Análisis de la red de autores de ciencia ficción de ClarkesworldMiguel Rebollo
 
Y sin embargo... se mueve. Dinámica de las redes complejas
Y sin embargo... se mueve. Dinámica de las redes complejasY sin embargo... se mueve. Dinámica de las redes complejas
Y sin embargo... se mueve. Dinámica de las redes complejasMiguel Rebollo
 
Exámenes en grupo y pruebas de corrección como alternativas a la evaluación
Exámenes en grupo y pruebas de corrección como alternativas a la evaluaciónExámenes en grupo y pruebas de corrección como alternativas a la evaluación
Exámenes en grupo y pruebas de corrección como alternativas a la evaluaciónMiguel Rebollo
 
Gamification. Key Concepts
Gamification. Key ConceptsGamification. Key Concepts
Gamification. Key ConceptsMiguel Rebollo
 
Using Distributed Risk Maps by Consensus as a Complement to Contact Tracing Apps
Using Distributed Risk Maps by Consensus as a Complement to Contact Tracing AppsUsing Distributed Risk Maps by Consensus as a Complement to Contact Tracing Apps
Using Distributed Risk Maps by Consensus as a Complement to Contact Tracing AppsMiguel Rebollo
 
Distributed Ledger and Robust Consensus for Agreements
Distributed Ledger and Robust Consensus for AgreementsDistributed Ledger and Robust Consensus for Agreements
Distributed Ledger and Robust Consensus for AgreementsMiguel Rebollo
 
Detección de nodos tramposos en procesos de consenso en redes
Detección de nodos tramposos en procesos de consenso en redesDetección de nodos tramposos en procesos de consenso en redes
Detección de nodos tramposos en procesos de consenso en redesMiguel Rebollo
 
La hora del código: ApS para fomentar el pensamiento computacional
La hora del código: ApS para fomentar el pensamiento computacionalLa hora del código: ApS para fomentar el pensamiento computacional
La hora del código: ApS para fomentar el pensamiento computacionalMiguel Rebollo
 
Procesos de enseñanza-aprendizaje en red
Procesos de enseñanza-aprendizaje en redProcesos de enseñanza-aprendizaje en red
Procesos de enseñanza-aprendizaje en redMiguel Rebollo
 
desarrollo de competencias a través de narrativas transmedia
desarrollo de competencias a través de narrativas transmediadesarrollo de competencias a través de narrativas transmedia
desarrollo de competencias a través de narrativas transmediaMiguel Rebollo
 
Distributed Group Analytical Hierarchical Process by Consensus
 Distributed Group Analytical Hierarchical Process by Consensus Distributed Group Analytical Hierarchical Process by Consensus
Distributed Group Analytical Hierarchical Process by ConsensusMiguel Rebollo
 
Análisis de ciudades a través de su actividad en redes sociales
Análisis de ciudades a través de su actividad en redes socialesAnálisis de ciudades a través de su actividad en redes sociales
Análisis de ciudades a través de su actividad en redes socialesMiguel Rebollo
 
Análisis de datos en redes sociales
Análisis de datos en redes socialesAnálisis de datos en redes sociales
Análisis de datos en redes socialesMiguel Rebollo
 
The multigent Layer for CALMeD SURF
The multigent Layer for CALMeD SURFThe multigent Layer for CALMeD SURF
The multigent Layer for CALMeD SURFMiguel Rebollo
 
Narrativa transmedia en el aula
Narrativa transmedia en el aulaNarrativa transmedia en el aula
Narrativa transmedia en el aulaMiguel Rebollo
 
Using geo-tagged sentiment to better understand social interactions
 Using geo-tagged sentiment to better understand social interactions Using geo-tagged sentiment to better understand social interactions
Using geo-tagged sentiment to better understand social interactionsMiguel Rebollo
 
Transport Network Analysis for Smart Open Fleets
Transport Network Analysis for Smart Open FleetsTransport Network Analysis for Smart Open Fleets
Transport Network Analysis for Smart Open FleetsMiguel Rebollo
 
Análisis de sentimientos en Twitter mediante HMM
Análisis de sentimientos en Twitter mediante HMMAnálisis de sentimientos en Twitter mediante HMM
Análisis de sentimientos en Twitter mediante HMMMiguel Rebollo
 

Plus de Miguel Rebollo (20)

GTG-CoL: A Decentralized Federated Learning Based on Consensus for Dynamic N...
 GTG-CoL: A Decentralized Federated Learning Based on Consensus for Dynamic N... GTG-CoL: A Decentralized Federated Learning Based on Consensus for Dynamic N...
GTG-CoL: A Decentralized Federated Learning Based on Consensus for Dynamic N...
 
Co-Learning: Consensus-based Learning for Multi-Agent Systems
 Co-Learning: Consensus-based Learning for Multi-Agent Systems Co-Learning: Consensus-based Learning for Multi-Agent Systems
Co-Learning: Consensus-based Learning for Multi-Agent Systems
 
Análisis de la red de autores de ciencia ficción de Clarkesworld
Análisis de la red de autores de ciencia ficción de ClarkesworldAnálisis de la red de autores de ciencia ficción de Clarkesworld
Análisis de la red de autores de ciencia ficción de Clarkesworld
 
Y sin embargo... se mueve. Dinámica de las redes complejas
Y sin embargo... se mueve. Dinámica de las redes complejasY sin embargo... se mueve. Dinámica de las redes complejas
Y sin embargo... se mueve. Dinámica de las redes complejas
 
Exámenes en grupo y pruebas de corrección como alternativas a la evaluación
Exámenes en grupo y pruebas de corrección como alternativas a la evaluaciónExámenes en grupo y pruebas de corrección como alternativas a la evaluación
Exámenes en grupo y pruebas de corrección como alternativas a la evaluación
 
Gamification. Key Concepts
Gamification. Key ConceptsGamification. Key Concepts
Gamification. Key Concepts
 
Using Distributed Risk Maps by Consensus as a Complement to Contact Tracing Apps
Using Distributed Risk Maps by Consensus as a Complement to Contact Tracing AppsUsing Distributed Risk Maps by Consensus as a Complement to Contact Tracing Apps
Using Distributed Risk Maps by Consensus as a Complement to Contact Tracing Apps
 
Distributed Ledger and Robust Consensus for Agreements
Distributed Ledger and Robust Consensus for AgreementsDistributed Ledger and Robust Consensus for Agreements
Distributed Ledger and Robust Consensus for Agreements
 
Detección de nodos tramposos en procesos de consenso en redes
Detección de nodos tramposos en procesos de consenso en redesDetección de nodos tramposos en procesos de consenso en redes
Detección de nodos tramposos en procesos de consenso en redes
 
La hora del código: ApS para fomentar el pensamiento computacional
La hora del código: ApS para fomentar el pensamiento computacionalLa hora del código: ApS para fomentar el pensamiento computacional
La hora del código: ApS para fomentar el pensamiento computacional
 
Procesos de enseñanza-aprendizaje en red
Procesos de enseñanza-aprendizaje en redProcesos de enseñanza-aprendizaje en red
Procesos de enseñanza-aprendizaje en red
 
desarrollo de competencias a través de narrativas transmedia
desarrollo de competencias a través de narrativas transmediadesarrollo de competencias a través de narrativas transmedia
desarrollo de competencias a través de narrativas transmedia
 
Distributed Group Analytical Hierarchical Process by Consensus
 Distributed Group Analytical Hierarchical Process by Consensus Distributed Group Analytical Hierarchical Process by Consensus
Distributed Group Analytical Hierarchical Process by Consensus
 
Análisis de ciudades a través de su actividad en redes sociales
Análisis de ciudades a través de su actividad en redes socialesAnálisis de ciudades a través de su actividad en redes sociales
Análisis de ciudades a través de su actividad en redes sociales
 
Análisis de datos en redes sociales
Análisis de datos en redes socialesAnálisis de datos en redes sociales
Análisis de datos en redes sociales
 
The multigent Layer for CALMeD SURF
The multigent Layer for CALMeD SURFThe multigent Layer for CALMeD SURF
The multigent Layer for CALMeD SURF
 
Narrativa transmedia en el aula
Narrativa transmedia en el aulaNarrativa transmedia en el aula
Narrativa transmedia en el aula
 
Using geo-tagged sentiment to better understand social interactions
 Using geo-tagged sentiment to better understand social interactions Using geo-tagged sentiment to better understand social interactions
Using geo-tagged sentiment to better understand social interactions
 
Transport Network Analysis for Smart Open Fleets
Transport Network Analysis for Smart Open FleetsTransport Network Analysis for Smart Open Fleets
Transport Network Analysis for Smart Open Fleets
 
Análisis de sentimientos en Twitter mediante HMM
Análisis de sentimientos en Twitter mediante HMMAnálisis de sentimientos en Twitter mediante HMM
Análisis de sentimientos en Twitter mediante HMM
 

Mechanisms to Promote Cooperation in Decentralized Services

  • 1. Outline System Model Cooperation Mechanisms Results Conclusions Mechanisms to promote cooperation in decentralized services E. del Val M. Rebollo V. Botti Univ. Politecnica de Valencia (Spain) EUMAS ’12 Dublin, December 2012 M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 2. Outline System Model Cooperation Mechanisms Results Conclusions Promoting Cooperation Motivation There are scenarios in decentralized systems in which cooperation plays a central role agents connected in networks bounded rationality heterogeneous, self-interested agents M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 3. Outline System Model Cooperation Mechanisms Results Conclusions Our Proposal The challenge Obtain an emergent, cooperative global behavior even when cooperators are a minority, from local decisions. What is done. . . a network structure that ensures navigation and efficiency structural changes to isolate undesired agents incentives to promote cooperation M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 4. Outline System Model Cooperation Mechanisms Results Conclusions Outline 1 Outline 2 System Model 3 Cooperation Mechanisms 4 Results 5 Conclusions M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 5. Outline System Model Cooperation Mechanisms Results Conclusions System Model Definition (Open Service-Oriented MAS) (A, L), where A = {ai , ..., an } is a finite set of autonomous agents that are part of the system, and L ⊆ A × A is the set of links, where each link (ai , aj ) ∈ L M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 6. Outline System Model Cooperation Mechanisms Results Conclusions System Model Definition (Agent) is a tuple (Si , Ni , sti ) where: Si = {s1 , . . . , sl } is the set of semantic service descriptions of the services provided by the agent (WSDL); Ni is the set of neighbors of the agent, Ni ⊆ A − {ai } : ∀aj ∈ Ni , ∃(ai , aj ) ∈ L, and |Ni | > 0. It is assumed that |Ni | |A|; sti is the internal state of the agent. πi : sti → Ni is the neighbor selection function that determines the most promising neighbor to provide a service; ρi : sti → Ψ is the adaptation selection function where Ψ is the set of finite adaptation actions of the agent. M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 7. Outline System Model Cooperation Mechanisms Results Conclusions Network Creation probabilistic relations baed on homophily (assortativity, similarity) two agents are similar if they provide similar services H = αHv + (1 − α)Hs growing network structure (exponential degree distribution) certain characteristics of a small-world network (short paths, clustering) M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 8. Outline System Model Cooperation Mechanisms Results Conclusions Service Discovery navigation problem in networks (it relies in the agent cooperation) hill climbing (greedy) method    |Nj |       H(aj , at )   π(at ) = argmax 1 − 1 −        H(an , at )    aj ∈Ni    an ∈Ni agents pass the query until the desire service is found it is a problem with self–interested agents M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 9. Outline System Model Cooperation Mechanisms Results Conclusions Social Plasticity capacity to change relations as times passes link utility decays with time depends on the queries aj forwards 1 D(aj ) = 1+e −γ M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 10. Outline System Model Cooperation Mechanisms Results Conclusions Social Plasticity when an agent breaks a link, a substitute must be found (maintain the network structure) criteria neighbor of neighbor a similar agent to the previous one rewire links has not a cost M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 11. Outline System Model Cooperation Mechanisms Results Conclusions Social Plasticity M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 12. Outline System Model Cooperation Mechanisms Results Conclusions Social Plasticity M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 13. Outline System Model Cooperation Mechanisms Results Conclusions Incentives each action implies a cost (ask for a service and forward) a reward is obtained if the service is found rewards are provided by the system agents imitated the strategy of successful neighbors M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 14. Outline System Model Cooperation Mechanisms Results Conclusions Incentives M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 15. Outline System Model Cooperation Mechanisms Results Conclusions Combining social plasticity and incentives Both strategies promote cooperation in general but it is not enough if non–cooperative agents has a high degree network broken in isolated parts rewire cost –> not affordable for some agents payoff not enough to promote cooperation the combined model 1 incentives to change the behavior of non–cooperatives 2 rewire links if it fails M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 16. Outline System Model Cooperation Mechanisms Results Conclusions Experiment Design Configuration 1,000 agents, 10 different networks 100 steps to forward a query, snapshots after 5,000 queries varying the initial prop. of collaborators Strategies Social plasticity (SP) Incentives Reinforcement Learning (RL) using WOLF Game-theory approach, using Prisoner’s Dilemma (PD) Incentives + Social Plasticity (I+SP) M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 17. Outline System Model Cooperation Mechanisms Results Conclusions Measures proportion of collaborator / non–collaborators average path length (better if smaller) search failures due to non–collaboration search success (including TTL) M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 18. Outline System Model Cooperation Mechanisms Results Conclusions 60% of collaborators (num and path length) M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 19. Outline System Model Cooperation Mechanisms Results Conclusions 40% of collaborators (num and path length) M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 20. Outline System Model Cooperation Mechanisms Results Conclusions 60% of collaborators (failures and success) M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 21. Outline System Model Cooperation Mechanisms Results Conclusions 40% of collaborators (failures and success) M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services
  • 22. Outline System Model Cooperation Mechanisms Results Conclusions Conclusions improving cooperation to solve navigation problem in networks applied to decentralized service management combination of structural changes and incentives improves the performance when non-collaborators are ’important’ in the network works by imitation: a core of collaborators is needed a guess: the size of the core depends on network characteristics (percolation, efficience, centrality coefficient) M. Rebollo et al. (UPV) EUMAS’12 Mechanisms to promote cooperation in decentralized services