https://github.com/ericadamski/whatdoweneedtoknowtoelect-netlogo

A model based on the research paper 'What Do We Need to Know to Elect in Networks with Unknown Participants?' by Jérémie Chalopin, Emmanuel Godard and Antoine Naudin⋆ LIF, Université Aix-Marseille and CNRS
https://github.com/ericadamski/whatdoweneedtoknowtoelect-netlogo

Last synced: 3 months ago
JSON representation

A model based on the research paper 'What Do We Need to Know to Elect in Networks with Unknown Participants?' by Jérémie Chalopin, Emmanuel Godard and Antoine Naudin⋆ LIF, Université Aix-Marseille and CNRS

• Host: GitHub
• URL: https://github.com/ericadamski/whatdoweneedtoknowtoelect-netlogo
• Owner: ericadamski
• Created: 2014-11-08T18:11:54.000Z (over 10 years ago)
• Default Branch: master
• Last Pushed: 2014-12-07T21:48:37.000Z (over 10 years ago)
• Last Synced: 2025-01-06T09:45:31.420Z (5 months ago)
• Language: NetLogo
• Size: 2.56 MB
• Stars: 0
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
WhatDoWeNeedToKnowToElect-Netlogo

=================================

A model based on the research paper : 

#####'What Do We Need to Know to Elect in Networks with Unknown Participants?' 

>Jérémie Chalopin, Emmanuel Godard and Antoine Naudin*

>LIF, Université Aix-Marseille and CNRS

###Some Important Notation

  * H ⊑↓ G 

      - a subgraph H of G is a subgraph closed by successors of G

  * ⊥

      - empty representation

  * Succ(v)

      - a successor list given by { id(v') | v' ∈ next(v) } ( all neighbours with edges from v )

  * M

      - a mailbox

  * Coverd(M)

      - for an id(v) there is a pair (id(v), Succ(v)) ∈ M i.e { id(v) | (id(v), Succ(v)) ∈ M }

  * View(M)

      - (for an id(v) there exists a pair (id(v), Succs(v)) ∈ M AND id(v) is in Succ(v)) Union Coverd(M)

  * Vc

      - View(M)

  * Ec

      - The set of edges in the View of M

  * C(M)

      - (Vc,Ec) a graph composed of the View of a process

  * F

      - a family of graphs

  * XF (Characteristic Function)

      - In this model we are assuming that all nodes know the size of the network, so for the characteristic function we count the number of vertices in C(M) in order to determine if C(M) ∈ the family F