|
FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
|
A version of VariableElection that uses random numbers as scores and lies in order to protect topology privacy. More...

Public Member Functions | |
| SecureVarElection (DCOPProblemInterface<?, ?> problem, Element parameters) | |
| Constructor from XML descriptions. | |
| SecureVarElection (DCOPProblemInterface<?, ?> problem, int minNbrLies) | |
| Alternate constructor. | |
| Public Member Functions inherited from frodo2.algorithms.varOrdering.election.VariableElection< Integer > | |
| VariableElection (DCOPProblemInterface<?, ?> problem, ScoringHeuristic< S > heuristic, int nbrSteps) | |
| Constructor. | |
| Collection< MessageType > | getMsgTypes () |
| Listens to messages of types LeaderElectionMaxID.START_MSG_TYPE and LeaderElectionMaxID.LE_MSG_TYPE. | |
| void | notifyIn (Message msg) |
| The actual algorithm. | |
| void | setQueue (Queue queue) |
| void | sendMessageToSelf (Message msg) |
| Method called by the LeaderElectionMaxID listeners to send their outputs. | |
Protected Member Functions | |
| VarElectionMessenger | newListener (String var, Integer score, Collection< String > neighbors) |
| Instantiates a new VarElectionMessenger. | |
| Protected Member Functions inherited from frodo2.algorithms.varOrdering.election.VariableElection< Integer > | |
| LeaderElectionMaxID< S > | newListener (String var, S score, Collection< String > neighbors) |
| Instantiates a new LeaderElectionMaxID. | |
Private Attributes | |
| int | minNbrLies |
| The minimum number of times the agents should lie. | |
Additional Inherited Members | |
| Static Public Attributes inherited from frodo2.algorithms.varOrdering.election.VariableElection< Integer > | |
| static MessageType | START_MSG_TYPE |
| The type of the message telling the module to start. | |
| static MessageType | FINISH_MSG_TYPE |
| The type of the message telling the agent finished. | |
| Protected Attributes inherited from frodo2.algorithms.varOrdering.election.VariableElection< Integer > | |
| int | nbrSteps |
| The number of steps the protocol should run before it terminates. | |
| ScoringHeuristic< S > | heuristic |
| The heuristic. | |
| Package Functions inherited from frodo2.algorithms.varOrdering.election.VariableElection< Integer > | |
| public< R extends Object > void | sendMessageToMulti (Collection< R > recipients, Message msg) |
| Method called by the LeaderElectionMaxID listeners in order to send a message to specified variables. | |
A version of VariableElection that uses random numbers as scores and lies in order to protect topology privacy.
| frodo2.algorithms.varOrdering.election.SecureVarElection.SecureVarElection | ( | DCOPProblemInterface<?, ?> | problem, |
| Element | parameters ) |
Constructor from XML descriptions.
| problem | description of the problem |
| parameters | description of the parameters of this protocol |
References frodo2.algorithms.varOrdering.election.VariableElection< Integer >.heuristic, minNbrLies, frodo2.algorithms.varOrdering.election.VariableElection< Integer >.nbrSteps, and frodo2.algorithms.varOrdering.election.VariableElection< Integer >.problem.
| frodo2.algorithms.varOrdering.election.SecureVarElection.SecureVarElection | ( | DCOPProblemInterface<?, ?> | problem, |
| int | minNbrLies ) |
Alternate constructor.
| problem | the problem |
| minNbrLies | the minimum number of lies |
References frodo2.algorithms.varOrdering.election.VariableElection< Integer >.heuristic, minNbrLies, frodo2.algorithms.varOrdering.election.VariableElection< Integer >.nbrSteps, and frodo2.algorithms.varOrdering.election.VariableElection< Integer >.problem.
|
protected |
Instantiates a new VarElectionMessenger.
| var | the variable |
| score | the score |
| neighbors | the variable's neighbors |
References minNbrLies.
|
private |
The minimum number of times the agents should lie.
It must be greater than the diameter of the largest component of the constraint graph.
Referenced by newListener(), SecureVarElection(), and SecureVarElection().