A DCOP solver using P2-DPOP. More...

Inheritance diagram for frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >:

[legend]

Public Member Functions
	P2_DPOPsolver (String agentDesc)
	Constructor.
	P2_DPOPsolver (String agentDesc, boolean useTCP)
	Constructor.
	P2_DPOPsolver (String filename, boolean useTCP, int shift)
	Constructor from a specific agent configuration file.
	P2_DPOPsolver (Document agentDesc)
	Constructor.
	P2_DPOPsolver (Document agentDesc, boolean useTCP)
	Constructor.
	P2_DPOPsolver (Document agentDesc, Class< ? extends XCSPparser< V, U > > parserClass)
	Constructor.
	P2_DPOPsolver (Document agentDesc, Class< ? extends XCSPparser< V, U > > parserClass, boolean useTCP)
	Constructor.
ArrayList< StatsReporter >	getSolGatherers ()
Solution< V, U >	buildSolution ()
void	clear ()
	Clear this class' member attributes.
HashMap< String, DFSview< V, U > >	getDFS ()
void	setInfinity (int infinity)
	Sets the value of infinity used by the CryptoScheme.
Solution< V, U >	solve (Document problem, Integer infinity)
	Solves the input problem.
Solution< V, U >	solve (DCOPProblemInterface< V, U > problem, Integer infinity)
	Solves the input problem.
Solution< V, U >	solve (Document problem, Long timeout, int infinity)
	Solves the input problem.
Solution< V, U >	solve (DCOPProblemInterface< V, U > problem, Long timeout, int infinity)
	Solves the input problem.
Solution< V, U >	solve (Document problem, int nbrElectionRounds, int infinity)
	Solves the input problem.
Solution< V, U >	solve (DCOPProblemInterface< V, U > problem, int nbrElectionRounds, int infinity)
	Solves the input problem.
Solution< V, U >	solve (Document problem, int nbrElectionRounds, boolean measureMsgs, int infinity)
	Solves the input problem.
Solution< V, U >	solve (DCOPProblemInterface< V, U > problem, int nbrElectionRounds, boolean measureMsgs, int infinity)
	Solves the input problem.
Solution< V, U >	solve (Document problem, int nbrElectionRounds, boolean measureMsgs, Long timeout, boolean cleanAfterwards, int infinity)
	Solves the input problem.
Solution< V, U >	solve (DCOPProblemInterface< V, U > problem, int nbrElectionRounds, boolean measureMsgs, Long timeout, boolean cleanAfterwards, int infinity)
	Solves the input problem.
Solution< V, U >	solve (Document problem, int nbrElectionRounds, boolean measureMsgs, Long timeout, int infinity)
	Solves the input problem.
Solution< V, U >	solve (DCOPProblemInterface< V, U > problem, int nbrElectionRounds, boolean measureMsgs, Long timeout, int infinity)
	Solves the input problem.
Solution< V, U >	solve (Document problem, int nbrElectionRounds, Long timeout, int infinity)
	Solves the input problem.
Solution< V, U >	solve (DCOPProblemInterface< V, U > problem, int nbrElectionRounds, Long timeout, int infinity)
	Solves the input problem.
Public Member Functions inherited from frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable< U > >
	DPOPsolver ()
	Default constructor.
	DPOPsolver (boolean useTCP)
	Constructor.
	DPOPsolver (String agentDescription)
	Constructor.
	DPOPsolver (String agentDescription, boolean useTCP)
	Constructor.
	DPOPsolver (Class< V > domClass, Class< U > utilClass)
	Constructor.
	DPOPsolver (Class< V > domClass, Class< U > utilClass, boolean useTCP)
	Constructor.
	DPOPsolver (Document agentDesc)
	Constructor.
	DPOPsolver (Document agentDesc, boolean useTCP)
	Constructor.
	DPOPsolver (Document agentDesc, Class< V > domClass, Class< U > utilClass)
	Constructor.
	DPOPsolver (Document agentDesc, Class< V > domClass, Class< U > utilClass, boolean useTCP)
	Constructor.
	DPOPsolver (Document agentDesc, Class< ? extends XCSPparser< V, U > > parserClass)
	Constructor.
	DPOPsolver (Document agentDesc, Class< ? extends XCSPparser< V, U > > parserClass, boolean useTCP)
	Constructor.
	DPOPsolver (String agentDescFile, Class< V > domClass, Class< U > utilClass)
	Constructor.
	DPOPsolver (String agentDescFile, Class< V > domClass, Class< U > utilClass, boolean useTCP)
	Constructor.
Public Member Functions inherited from frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
	AbstractDCOPsolver (String agentDesc, boolean measureTime, boolean useTCP, boolean measureMsgs, Class<? extends XCSPparser< V, U > > parserClass, Class< V > domClass, Class< U > valuationClass)
	Constructor.
S	solve (Document problem, int nbrElectionRounds, boolean measureMsgs, Long timeout, boolean cleanAfterwards)
S	solve (DCOPProblemInterface< V, U > problem, int nbrElectionRounds, boolean measureMsgs, Long timeout, boolean cleanAfterwards)
S	solve (Document problem)
S	solve (DCOPProblemInterface< V, U > problem)
S	solve (Document problem, Long timeout)
S	solve (DCOPProblemInterface< V, U > problem, Long timeout)
S	solve (Document problem, boolean cleanAfterwards)
S	solve (DCOPProblemInterface< V, U > problem, boolean cleanAfterwards)
S	solve (Document problem, int nbrElectionRounds)
S	solve (DCOPProblemInterface< V, U > problem, int nbrElectionRounds)
S	solve (Document problem, int nbrElectionRounds, boolean measureMsgs)
S	solve (DCOPProblemInterface< V, U > problem, int nbrElectionRounds, boolean measureMsgs)
S	solve (Document problem, int nbrElectionRounds, boolean measureMsgs, Long timeout)
S	solve (DCOPProblemInterface< V, U > problem, int nbrElectionRounds, boolean measureMsgs, Long timeout)
S	solve (Document problem, int nbrElectionRounds, Long timeout)
S	solve (DCOPProblemInterface< V, U > problem, int nbrElectionRounds, Long timeout)
S	solve (Document problem, boolean cleanAfterwards, Long timeout)
S	solve (DCOPProblemInterface< V, U > problem, boolean cleanAfterwards, Long timeout) throws OutOfMemoryError
Public Member Functions inherited from frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >
void	setProblem (P problem)
	Sets the problem.
void	setFactory (AgentFactory< V, U > factory)
	Sets the agent factory.
void	setDomClass (Class< V > domClass)
	Sets the class for variable values.
void	setUtilClass (Class< U > utilClass)
	Sets the class for utility values.
Document	getAgentDesc ()
abstract List<? extends StatsReporter >	getSolGatherers ()
abstract S	buildSolution ()
S	solve (Document problem)
	Solves the input problem.
String	plotStats (Solution< V, U > sol)
	Puts the statistics in a format that can easily be processed after the experiments.
String	plotDummyStats (boolean maximize)
	Used when the solver was not able to solve the problem.

Protected Member Functions
void	setNbrElectionRounds (int nbrElectionRounds)
Protected Member Functions inherited from frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
String	getFileHeader (Document problemFile)
	Returns the header for the output CSV file.
String	getParamsHeader ()
String	getParamsToLine ()
String	getProbStats (Document problemFile, String probFilename)
	Parses the statistics about the problem instance.
String	getTimeoutLine (String algoName, Document problemFile, String probFilename)
	Returns a timeout line for the output CSV file.
	AbstractDCOPsolver ()
	Dummy constructor.
	AbstractDCOPsolver (String agentDescFile)
	Constructor from an agent configuration file.
	AbstractDCOPsolver (String agentDescFile, boolean useTCP)
	Constructor from an agent configuration file.
	AbstractDCOPsolver (String agentDescFile, boolean useTCP, int shift)
	Constructor from an agent configuration file.
	AbstractDCOPsolver (Document agentDesc)
	Constructor.
void	parseParams (String[] params)
	Parses solver parameters.
	AbstractDCOPsolver (Document agentDesc, boolean useTCP)
	Constructor.
	AbstractDCOPsolver (Document agentDesc, Class< ? extends XCSPparser< V, U > > parserClass)
	Constructor.
	AbstractDCOPsolver (Document agentDesc, Class< ? extends XCSPparser< V, U > > parserClass, boolean useTCP)
	Constructor.
void	setProblemRescalerShift (int shift)
	Sets the shift parameter of the ProblemRescaler module (if used).
void	overrideMsgTypes ()
	Overrides message types if necessary.
Protected Member Functions inherited from frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >
	AbstractSolver ()
	Dummy constructor.
void	clear ()
	Clears the parser.

Package Functions
public< UL extends AddableLimited< U, UL > >	P2_DPOPsolver ()
	Default constructor.
public< UL extends AddableLimited< U, UL > >	P2_DPOPsolver (boolean useTCP)
	Constructor.
public< UL extends AddableLimited< U, UL > >	P2_DPOPsolver (Class< V > domClass, Class< U > utilClass, Class< UL > eUtilClass)
	Constructor.
public< UL extends AddableLimited< U, UL > >	P2_DPOPsolver (Class< V > domClass, Class< U > utilClass, Class< UL > eUtilClass, boolean useTCP)
	Constructor.
public< UL extends AddableLimited< U, UL > >	P2_DPOPsolver (String agentDescFile, Class< V > domClass, Class< U > utilClass, Class< UL > eUtilClass)
	Constructor.
public< UL extends AddableLimited< U, UL > >	P2_DPOPsolver (String agentDescFile, Class< V > domClass, Class< U > utilClass, Class< UL > eUtilClass, boolean useTCP)
	Constructor.
public< UL extends AddableLimited< U, UL > >	P2_DPOPsolver (Document agentDesc, Class< V > domClass, Class< U > utilClass, Class< UL > eUtilClass)
	Constructor.
public< UL extends AddableLimited< U, UL > >	P2_DPOPsolver (Document agentDesc, Class< V > domClass, Class< U > utilClass, Class< UL > eUtilClass, boolean useTCP)
	Constructor.

Private Attributes
EncryptedUTIL< V, U,?>	encryptModule
	The EncryptedUTIL module.
CollaborativeDecryption	collabDecrypt
	The Collaborative Decryption module.
RerootRequester< V, U >	rerootRequester
	The RerootRequester module.

Additional Inherited Members
Static Public Member Functions inherited from frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
static void	main (String[] args) throws Exception
	Solves a problem and writes statistics to a file.
Protected Attributes inherited from frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable< U > >
SolutionCollector< V, U >	solCollector
	The solution collector.
UTILpropagation< V, U >	utilModule
	The UTIL propagation module.
DFSgeneration< V, U >	dfsModule
	The DFSgeneration module.
Protected Attributes inherited from frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >
Document	agentDesc
	Description of the agent to be used.
AgentFactory< V, U >	factory
	The agent factory.
Class< ? extends XCSPparser< V, U > >	parserClass
	The class of the parser to be used.
List<? extends StatsReporter >	solGatherers
	The list of modules that record statistics about problem solving.
P	problem
	The problem.
final boolean	useTCP
	Whether to use TCP pipes or shared memory pipes.

Detailed Description

A DCOP solver using P2-DPOP.

Author: Eric Zbinden, Thomas Leaute

Parameters

<V>	class used for value
<U>	class used for utility values

Todo: Create a subclass of Solution that includes the stats from CollaborativeDecryption

Constructor & Destructor Documentation

◆ P2_DPOPsolver() [1/15]

public< UL extends AddableLimited< U, UL > > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >.P2_DPOPsolver ( )

package

Default constructor.

Parameters

<UL>	class used for encrypted utility values

References P2_DPOPsolver().

Referenced by P2_DPOPsolver(), and P2_DPOPsolver().

Here is the call graph for this function:

◆ P2_DPOPsolver() [2/15]

public< UL extends AddableLimited< U, UL > > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >.P2_DPOPsolver ( boolean useTCP )

package

Constructor.

Parameters

<UL>	class used for encrypted utility values
useTCP	Whether to use TCP pipes or shared memory pipes

Warning: Using TCP pipes automatically disables simulated time.

References P2_DPOPsolver(), and frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.useTCP.

Here is the call graph for this function:

◆ P2_DPOPsolver() [3/15]

public< UL extends AddableLimited< U, UL > > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.P2_DPOPsolver	(	Class< V >	domClass,
		Class< U >	utilClass,
		Class< UL >	eUtilClass )

package

Constructor.

Parameters

domClass	the class to use for variable values
utilClass	the class to use for utilities
eUtilClass	the class to use for encrypted utilities
<UL>	class used for encrypted utility values

◆ P2_DPOPsolver() [4/15]

public< UL extends AddableLimited< U, UL > > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.P2_DPOPsolver	(	Class< V >	domClass,
		Class< U >	utilClass,
		Class< UL >	eUtilClass,
		boolean	useTCP )

package

Constructor.

Parameters

domClass	the class to use for variable values
utilClass	the class to use for utilities
eUtilClass	the class to use for encrypted utilities
<UL>	class used for encrypted utility values
useTCP	Whether to use TCP pipes or shared memory pipes

Warning: Using TCP pipes automatically disables simulated time.

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.useTCP.

◆ P2_DPOPsolver() [5/15]

frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >.P2_DPOPsolver ( String agentDesc )

Constructor.

Parameters

agentDesc the agent description file

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.agentDesc.

◆ P2_DPOPsolver() [6/15]

frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.P2_DPOPsolver	(	String	agentDesc,
		boolean	useTCP )

Constructor.

Parameters

agentDesc	the agent description file
useTCP	whether to use TCP pipes

Warning: Using TCP pipes automatically disables simulated time.

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.agentDesc, and frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.useTCP.

◆ P2_DPOPsolver() [7/15]

frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.P2_DPOPsolver	(	String	filename,
		boolean	useTCP,
		int	shift )

Constructor from a specific agent configuration file.

Parameters

filename	the agent configuration file
useTCP	Whether to use TCP pipes or shared memory pipes
shift	The shift parameter for the ProblemRescaler (if used)

Warning: Using TCP pipes automatically disables simulated time.

References frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable, S extends Solution< V, U >.setProblemRescalerShift(), and frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.useTCP.

Here is the call graph for this function:

◆ P2_DPOPsolver() [8/15]

frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >.P2_DPOPsolver ( Document agentDesc )

Constructor.

Parameters

agentDesc the agent description

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.agentDesc.

◆ P2_DPOPsolver() [9/15]

frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.P2_DPOPsolver	(	Document	agentDesc,
		boolean	useTCP )

Constructor.

Parameters

agentDesc	the agent description
useTCP	Whether to use TCP pipes or shared memory pipes

Warning: Using TCP pipes automatically disables simulated time.

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.agentDesc, and frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.useTCP.

◆ P2_DPOPsolver() [10/15]

frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.P2_DPOPsolver	(	Document	agentDesc,
		Class< ? extends XCSPparser< V, U > >	parserClass )

Constructor.

Parameters

agentDesc	description of the agent to be used
parserClass	the class used to parse problems

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.agentDesc, and frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.parserClass.

◆ P2_DPOPsolver() [11/15]

frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.P2_DPOPsolver	(	Document	agentDesc,
		Class< ? extends XCSPparser< V, U > >	parserClass,
		boolean	useTCP )

Constructor.

Parameters

agentDesc	description of the agent to be used
parserClass	the class used to parse problems
useTCP	Whether to use TCP pipes or shared memory pipes

Warning: Using TCP pipes automatically disables simulated time.

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.agentDesc, frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.parserClass, and frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.useTCP.

◆ P2_DPOPsolver() [12/15]

public< UL extends AddableLimited< U, UL > > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.P2_DPOPsolver	(	String	agentDescFile,
		Class< V >	domClass,
		Class< U >	utilClass,
		Class< UL >	eUtilClass )

package

Constructor.

Parameters

agentDescFile	description of the agent to be used
domClass	the class to use for variable values
utilClass	the class to be used for utility values
eUtilClass	the class to be used for encrypted utility values
<UL>	class used for encrypted utility values

◆ P2_DPOPsolver() [13/15]

public< UL extends AddableLimited< U, UL > > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.P2_DPOPsolver	(	String	agentDescFile,
		Class< V >	domClass,
		Class< U >	utilClass,
		Class< UL >	eUtilClass,
		boolean	useTCP )

package

Constructor.

Parameters

agentDescFile	description of the agent to be used
domClass	the class to use for variable values
utilClass	the class to be used for utility values
eUtilClass	the class to be used for encrypted utility values
<UL>	class used for encrypted utility values
useTCP	Whether to use TCP pipes or shared memory pipes

Warning: Using TCP pipes automatically disables simulated time.

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.agentDesc, and frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.useTCP.

◆ P2_DPOPsolver() [14/15]

public< UL extends AddableLimited< U, UL > > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.P2_DPOPsolver	(	Document	agentDesc,
		Class< V >	domClass,
		Class< U >	utilClass,
		Class< UL >	eUtilClass )

package

Constructor.

Parameters

agentDesc	description of the agent to be used
domClass	the class to use for variable values
utilClass	the class to be used for utility values
eUtilClass	the class to be used for encrypted utility values
<UL>	class used for encrypted utility values

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.agentDesc.

◆ P2_DPOPsolver() [15/15]

public< UL extends AddableLimited< U, UL > > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.P2_DPOPsolver	(	Document	agentDesc,
		Class< V >	domClass,
		Class< U >	utilClass,
		Class< UL >	eUtilClass,
		boolean	useTCP )

package

Constructor.

Parameters

agentDesc	description of the agent to be used
domClass	the class to use for variable values
utilClass	the class to be used for utility values
eUtilClass	the class to be used for encrypted utility values
<UL>	class used for encrypted utility values
useTCP	Whether to use TCP pipes or shared memory pipes

Warning: Using TCP pipes automatically disables simulated time.

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.agentDesc, and frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.useTCP.

Member Function Documentation

◆ buildSolution()

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >.buildSolution ( )

See also: DPOPsolver.buildSolution()

Reimplemented from frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable >.

References frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable >.dfsModule, encryptModule, frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.factory, frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, and rerootRequester.

◆ clear()

void frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >.clear ( )

Clear this class' member attributes.

Reimplemented from frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable >.

References frodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >.OUTPUT_MSG_TYPE, and frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable >.ROOT_VAR_MSG_TYPE.

◆ getDFS()

HashMap< String, DFSview< V, U > > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >.getDFS ( )

Returns: null because P2-DPOP does not really run on a DFS

Reimplemented from frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable >.

◆ getSolGatherers()

ArrayList< StatsReporter > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >.getSolGatherers ( )

See also: DPOPsolver.getSolGatherers()

Reimplemented from frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable >.

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.agentDesc, collabDecrypt, frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable >.dfsModule, encryptModule, frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, rerootRequester, frodo2.algorithms.dpop.privacy.SecureCircularRouting.setSilent(), and frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.solGatherers.

Here is the call graph for this function:

◆ setInfinity()

void frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >.setInfinity ( int infinity )

Sets the value of infinity used by the CryptoScheme.

Parameters

infinity costs greater than or equal to this value will be considered infinite

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.agentDesc.

Referenced by frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.addTests(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), and solve().

◆ setNbrElectionRounds()

void frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >.setNbrElectionRounds ( int nbrElectionRounds )

protected

See also: DPOPsolver.setNbrElectionRounds(int)

Reimplemented from frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable, S extends Solution< V, U >.

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.agentDesc.

◆ solve() [1/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	DCOPProblemInterface< V, U >	problem,
		int	nbrElectionRounds,
		boolean	measureMsgs,
		int	infinity )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
measureMsgs	whether message sizes should be measured
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, and setInfinity().

Here is the call graph for this function:

◆ solve() [2/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	DCOPProblemInterface< V, U >	problem,
		int	nbrElectionRounds,
		boolean	measureMsgs,
		Long	timeout,
		boolean	cleanAfterwards,
		int	infinity )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
measureMsgs	whether message sizes should be measured
timeout	timeout in ms, if `null`, no timeout is used
cleanAfterwards	if `true`, cleans all the agents and the queue when they're done
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, setInfinity(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [3/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	DCOPProblemInterface< V, U >	problem,
		int	nbrElectionRounds,
		boolean	measureMsgs,
		Long	timeout,
		int	infinity )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
measureMsgs	whether message sizes should be measured
timeout	timeout in ms, if `null`, no timeout is used
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, setInfinity(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [4/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	DCOPProblemInterface< V, U >	problem,
		int	nbrElectionRounds,
		int	infinity )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, and setInfinity().

Here is the call graph for this function:

◆ solve() [5/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	DCOPProblemInterface< V, U >	problem,
		int	nbrElectionRounds,
		Long	timeout,
		int	infinity )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
timeout	timeout in ms, if `null`, no timeout is used
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, setInfinity(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [6/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	DCOPProblemInterface< V, U >	problem,
		Integer	infinity )

Solves the input problem.

Parameters

problem	the problem
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, and setInfinity().

Here is the call graph for this function:

◆ solve() [7/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	DCOPProblemInterface< V, U >	problem,
		Long	timeout,
		int	infinity )

Solves the input problem.

Parameters

problem	the problem
timeout	timeout in ms, if `null`, no timeout is used
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, setInfinity(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [8/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	Document	problem,
		int	nbrElectionRounds,
		boolean	measureMsgs,
		int	infinity )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
measureMsgs	whether message sizes should be measured
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, and setInfinity().

Here is the call graph for this function:

◆ solve() [9/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	Document	problem,
		int	nbrElectionRounds,
		boolean	measureMsgs,
		Long	timeout,
		boolean	cleanAfterwards,
		int	infinity )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
measureMsgs	whether message sizes should be measured
timeout	timeout in ms, if `null`, no timeout is used
cleanAfterwards	if `true`, cleans all the agents and the queue when they're done
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, setInfinity(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [10/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	Document	problem,
		int	nbrElectionRounds,
		boolean	measureMsgs,
		Long	timeout,
		int	infinity )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
measureMsgs	whether message sizes should be measured
timeout	timeout in ms, if `null`, no timeout is used
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, setInfinity(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [11/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	Document	problem,
		int	nbrElectionRounds,
		int	infinity )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, and setInfinity().

Here is the call graph for this function:

◆ solve() [12/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	Document	problem,
		int	nbrElectionRounds,
		Long	timeout,
		int	infinity )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
timeout	timeout in ms, if `null`, no timeout is used
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, setInfinity(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [13/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	Document	problem,
		Integer	infinity )

Solves the input problem.

Parameters

problem	the problem
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, and setInfinity().

Referenced by frodo2.algorithms.dpop.privacy.test.P2_DPOPagentTest< V extends Addable< V >, E extends AddableLimited< AddableInteger, E >.test(), and frodo2.solutionSpaces.vehiclerouting.test.VRPtests.test().

Here is the call graph for this function:

◆ solve() [14/14]

Solution< V, U > frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve	(	Document	problem,
		Long	timeout,
		int	infinity )

Solves the input problem.

Parameters

problem	the problem
timeout	timeout in ms, if `null`, no timeout is used
infinity	costs greater than or equal to this value will be considered infinite

Returns: an optimal solution

References frodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S >.problem, setInfinity(), and frodo2.timeout.

Here is the call graph for this function:

Member Data Documentation

◆ collabDecrypt

CollaborativeDecryption frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >.collabDecrypt

private

The Collaborative Decryption module.

Referenced by getSolGatherers().

◆ encryptModule

EncryptedUTIL<V,U,?> frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >.encryptModule

private

The EncryptedUTIL module.

Referenced by buildSolution(), and getSolGatherers().

◆ rerootRequester

RerootRequester<V, U> frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable >.rerootRequester

private

The RerootRequester module.

Referenced by buildSolution(), and getSolGatherers().

The documentation for this class was generated from the following file:

src/frodo2/algorithms/dpop/privacy/P2_DPOPsolver.java

Public Member Functions

Protected Member Functions

Package Functions

Private Attributes

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ P2_DPOPsolver() [1/15]

◆ P2_DPOPsolver() [2/15]

◆ P2_DPOPsolver() [3/15]

◆ P2_DPOPsolver() [4/15]

◆ P2_DPOPsolver() [5/15]

◆ P2_DPOPsolver() [6/15]

◆ P2_DPOPsolver() [7/15]

◆ P2_DPOPsolver() [8/15]

◆ P2_DPOPsolver() [9/15]

◆ P2_DPOPsolver() [10/15]

◆ P2_DPOPsolver() [11/15]

◆ P2_DPOPsolver() [12/15]

◆ P2_DPOPsolver() [13/15]

◆ P2_DPOPsolver() [14/15]

◆ P2_DPOPsolver() [15/15]

Member Function Documentation

◆ buildSolution()

◆ clear()

◆ getDFS()

◆ getSolGatherers()

◆ setInfinity()

◆ setNbrElectionRounds()

◆ solve() [1/14]

◆ solve() [2/14]

◆ solve() [3/14]

◆ solve() [4/14]

◆ solve() [5/14]

◆ solve() [6/14]

◆ solve() [7/14]

◆ solve() [8/14]

◆ solve() [9/14]

◆ solve() [10/14]

◆ solve() [11/14]

◆ solve() [12/14]

◆ solve() [13/14]

◆ solve() [14/14]

Member Data Documentation

◆ collabDecrypt

◆ encryptModule

◆ rerootRequester