The subproblem to be solved by a given agent. More...

Inheritance diagram for frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >:

[legend]

Public Member Functions
Set< String >	getAllVars ()
Set< String >	getVariables ()
Set< String >	getVariables (String owner)
	Returns the set of variables owned by a given agent.
Set< String >	getMyVars ()
Set< String >	getRandVars ()
int	getNbrIntVars ()
int	getNbrVars ()
int	getNbrVars (String agent)
	Returns the number of variables owned by the input agent.
Set< String >	getExtVars ()
Set< String >	getAnonymVars ()
boolean	addVariable (String name, String owner, String domain)
	Adds a new variable.
boolean	addVariable (String name, String owner, V[] domain)
	Adds a new variable.
V[]	getDomain (String var)
	Looks up the domain of a variable.
int	getDomainSize (String var)
	Returns the size of the domain of the input variable.
boolean	isRandom (String var)
	Returns whether the input variable is defined as a random variable.
boolean	maximize ()
void	setMaximize (boolean maximize)
	Sets whether utility should be maximized, or cost minimized.
void	rescale (U multiply, U add)
	Rescales the problem.
void	setDomain (String var, V[] dom)
	Sets the domain of a variable.
Map< String, String >	getOwners ()
String	getOwner (String var)
	Returns the name of the agent owning the input variable.
boolean	setOwner (String var, String owner)
	Sets the owner agent for the input variable.
Map< String, Set< String > >	getAgentNeighborhoods ()
Map< String, Set< String > >	getAgentNeighborhoods (String owner)
	Gets the agent neighborhoods.
Map< String, Set< String > >	getVarScopes ()
Map< String, Set< String > >	getNeighborhoods ()
	Returns the neighborhood of each internal variable.
Map< String, Set< String > >	getNeighborhoods (String agent)
	Returns the neighborhood of each variable owned by the input agent.
Map< String, Set< String > >	getNeighborhoods (String agent, final boolean withAnonymVars, final boolean onlyAnonymVars)
	Returns the neighborhood of each variable owned by the input agent.
Map< String, Set< String > >	getAnonymNeighborhoods ()
Map< String, Set< String > >	getAnonymNeighborhoods (String agent)
	For each variable owned by the input agent, return its collection of neighbors with no specified owner.
Map< String, Integer >	getNeighborhoodSizes ()
	Returns the number of neighboring variables of all internal variables.
Map< String, Integer >	getNeighborhoodSizes (String agent)
	Returns the number of neighboring variables of all variables owned by the input agent.
Collection< String >	getNeighborVars (String var)
	Returns the neighbors of the given variable.
HashSet< String >	getNeighborVars (String var, final boolean withAnonymVars)
	Returns the collection of neighbors of a given variable.
int	getNbrNeighbors (String var)
	Extracts the number of neighbors of an input variable.
int	getNbrNeighbors (String var, final boolean withAnonymVars)
	Extracts the number of neighbors of an input variable.
List< ? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces ()
	Returns the solution spaces in the problem.
List< ? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (final boolean withAnonymVars)
	Returns the solution spaces in the problem.
List< ? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (String var, Set< String > forbiddenVars)
	Returns the solution spaces involving the input variable and none of the forbidden variables.
List< ? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (String var, final boolean withAnonymVars)
	Extracts solution spaces involving the input variable from the constraints in the problem.
List< ? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (String var, final boolean withAnonymVars, Set< String > forbiddenVars)
	Extracts solution spaces involving the input variable from the constraints in the problem.
List< ? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (Set< String > vars, final boolean withAnonymVars, Set< String > forbiddenVars)
	Extracts solution spaces involving the input variables from the constraints in the problem.
List< ? extends UtilitySolutionSpace< V, U > >	getProbabilitySpaces ()
	Returns the probability spaces in the problem.
Map< String, ? extends UtilitySolutionSpace< V, U > >	getProbabilitySpacePerRandVar ()
	Returns the probability space of each random variable in the problem.
List< ? extends UtilitySolutionSpace< V, U > >	getProbabilitySpaces (String var)
	Returns the probability spaces involving the input variable.
void	setProbSpace (String var, Map< V, Double > prob)
	Adds to the problem a probability space for the input random variable.
boolean	removeSpace (String name)
	Removes the space with the given name.
boolean	addSolutionSpace (UtilitySolutionSpace< V, U > space)
	Adds a solution space to the problem.
UtilitySolutionSpace< V, U >	addUnarySpace (String name, String var, V[] dom, U[] valuations)
	Add a unary solution space to the problem.
UtilitySolutionSpace< V, U >	getUtility (Map< String, V > assignments)
	Computes the total utility of the input assignment to variables, ignoring variables with no specified owner.
UtilitySolutionSpace< V, U >	getUtility (Map< String, V > assignments, final boolean withAnonymVars)
	Computes the total utility of the input assignment to variables.
UtilitySolutionSpace< V, U >	getExpectedUtility (Map< String, V > assignments)
	Computes the expectation over the random variables of the utility for the input assignments.
UtilitySolutionSpace< V, U >	getParamUtility (Map< String[], BasicUtilitySolutionSpace< V, ArrayList< V > > > assignments)
	Computes the total utility of the input assignment to variables, conditioned on the values of parameters.
int	getNumberOfCoordinationConstraints ()
	Returns the number of spaces that are shared between different agents.
DCOPProblemInterface< V, U >	getSubProblem (String agent)
void	ground (String var, V val)
	Adds a constraint that enforces that var = val.
boolean	addAgent (String agent)
	Adds an agent to the problem.
Public Member Functions inherited from frodo2.solutionSpaces.ProblemInterface< V, U >
void	reset (ProblemInterface< V, U > newProblem)
	Resets this problem to be the same as the input one.
void	setDomClass (Class< V > domClass)
	Sets the class to be used for variable values.
Class< V >	getDomClass ()
void	setUtilClass (Class< U > utilClass)
	Sets the class to be used for utility values.
Class< U >	getUtilClass ()
U	getZeroUtility ()
U	getPlusInfUtility ()
U	getMinInfUtility ()
String	getAgent ()
Set< String >	getAgents ()
ProblemInterface< V, U >	getSubProblem (String agent)
	Builds the subproblem description for a given agent by extracting it from the overall problem description.
boolean	multipleTypes ()
void	incrNCCCs (long incr)
	Increments the number of constraint checks.
long	getNCCCs ()
void	setNCCCs (long ncccs)
	Sets the NCCC count.

Detailed Description

The subproblem to be solved by a given agent.

Author: Thomas Leaute

Parameters

<V>	the type used for variable values
<U>	the type used for utility values

Member Function Documentation

◆ addAgent()

boolean frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.addAgent ( String agent )

Adds an agent to the problem.

Parameters

agent the name of the agent

Returns: true if the agent has been added; false if it was already defined in the problem

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ addSolutionSpace()

boolean frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.addSolutionSpace ( UtilitySolutionSpace< V, U > space )

Adds a solution space to the problem.

Parameters

space the solution space

Returns: true if the space was added, false if the space's name is null or is already taken

Note: Ignores the relation name of this space, if any

Referenced by frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.addUnarySpace().

◆ addUnarySpace()

UtilitySolutionSpace< V, U > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.addUnarySpace	(	String	name,
		String	var,
		V[]	dom,
		U[]	valuations )

Add a unary solution space to the problem.

Parameters

name	the name of the space
var	the unique variable in the space's scope
dom	the allowed variable values
valuations	the valuation for each variable value

Returns: the newly added space

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable >.notifyIn().

◆ addVariable() [1/2]

boolean frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.addVariable	(	String	name,
		String	owner,
		String	domain )

Adds a new variable.

Parameters

name	variable name
owner	name of the variable's agent
domain	reference to the variable's domain

Returns: true if the variable was added, false if a variable with the same name already exists or no domain with given name exists

Implemented in frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.

◆ addVariable() [2/2]

boolean frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.addVariable	(	String	name,
		String	owner,
		V[]	domain )

Adds a new variable.

Parameters

name	variable name
owner	name of the variable's agent
domain	variable domain

Returns: true if the variable was added, false if a variable with the same name already exists

◆ getAgentNeighborhoods() [1/2]

Map< String, Set< String > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getAgentNeighborhoods ( )

Returns: for each internal variable, the collection of neighboring agents

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.gui.jung.JungVisualizer.drawEdges(), frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable >.factorGraphToDOT(), frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable >.init(), frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable >.notifyIn(), frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >.randomTest(), and frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest.setUp().

◆ getAgentNeighborhoods() [2/2]

Map< String, Set< String > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getAgentNeighborhoods ( String owner )

Gets the agent neighborhoods.

Parameters

owner the owner agent, or null if we want all variables

Returns: for each variable owned by the input agent (or for each variable if the input is null), the collection of neighboring agents

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getAllVars()

Set< String > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getAllVars ( )

Returns: all variables, including the ones with no specified owner

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.dpop.test.UTILpropagationTest >.Listener.Listener().

◆ getAnonymNeighborhoods() [1/2]

Map< String, Set< String > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getAnonymNeighborhoods ( )

Returns: for each internal variable, its collection of neighbors with no specified owner

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >, and frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.

◆ getAnonymNeighborhoods() [2/2]

Map< String, Set< String > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getAnonymNeighborhoods ( String agent )

For each variable owned by the input agent, return its collection of neighbors with no specified owner.

Parameters

agent the agent

Returns: for each internal variable, its set of neighbors with no specified owner

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >, and frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.

◆ getAnonymVars()

Set< String > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getAnonymVars ( )

Returns: the variables with no specified owner

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getDomain()

V[] frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getDomain ( String var )

Looks up the domain of a variable.

Parameters

var	the name of the variable

Returns: the domain for the input variable, or null if the variable or its domain is unknown

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getDomainSize()

int frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getDomainSize ( String var )

Returns the size of the domain of the input variable.

Parameters

var	the variable

Returns: the size of the domain of var

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.checkModulus(), frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable >.MaxWidthMinDom.getScore(), frodo2.algorithms.heuristics.SmallestDomainHeuristic.getScores(), frodo2.algorithms.test.ProblemTest.testGetDomainSize(), frodo2.algorithms.test.XCSPparserTest.testGetDomainSize(), and frodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable >.testRandom().

◆ getExpectedUtility()

UtilitySolutionSpace< V, U > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getExpectedUtility ( Map< String, V > assignments )

Computes the expectation over the random variables of the utility for the input assignments.

Parameters

assignments values for variables

Returns: the expectation of the utility for the input assignments

◆ getExtVars()

Set< String > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getExtVars ( )

Returns: the variables that are owned by a different agent

Implemented in frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.

Referenced by frodo2.algorithms.test.XCSPparserTest.testGetExtVars().

◆ getMyVars()

Set< String > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getMyVars ( )

Returns: the internal variables

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable >.centralization(), frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.init(), frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.init(), frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.init(), frodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable >.init(), and frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable >.processLinearOrdering().

◆ getNbrIntVars()

int frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getNbrIntVars ( )

Returns: the number of internal variables

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.dpop.VALUEpropagation< Val extends Addable< Val > >.computeOptValAndSendVALUEmsgs(), frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.init(), frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.init(), frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable >.init(), and frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.start().

◆ getNbrNeighbors() [1/2]

int frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getNbrNeighbors ( String var )

Extracts the number of neighbors of an input variable.

Parameters

var	the variable

Returns: the number of neighbor variables of var

Warning: Ignores variables with no specified owner.

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.init(), frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable, E extends AddableLimited< U, E >.notifyIn(), frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable >.notifyIn(), and frodo2.algorithms.test.ProblemTest.testGetNbrNeighbors().

◆ getNbrNeighbors() [2/2]

int frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.getNbrNeighbors	(	String	var,
		final boolean	withAnonymVars )

Extracts the number of neighbors of an input variable.

Parameters

var	the variable
withAnonymVars	if `false`, ignores variables with no specified owner

Returns: the number of neighbor variables of var

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getNbrVars() [1/2]

int frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getNbrVars ( )

Returns: the total number of variables with known owners

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.heuristics.RandScoringHeuristic.getScores(), frodo2.algorithms.heuristics.SmallestDomainHeuristic.getScores(), frodo2.algorithms.heuristics.VarNameHeuristic.getScores(), frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.init(), frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.LabelingPhase(), and frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.printDFS().

◆ getNbrVars() [2/2]

int frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getNbrVars ( String agent )

Returns the number of variables owned by the input agent.

Parameters

agent the agent

Returns: the number of variables owned by the input agent

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getNeighborhoods() [1/3]

Map< String, Set< String > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getNeighborhoods ( )

Returns the neighborhood of each internal variable.

Returns: for each of the agent's variables, its collection of neighbors

Warning: Ignores variables with no specified owner.

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.init(), frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable >.init(), and frodo2.algorithms.dpop.privacy.SecureCircularRouting.notifyIn().

◆ getNeighborhoods() [2/3]

Map< String, Set< String > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getNeighborhoods ( String agent )

Returns the neighborhood of each variable owned by the input agent.

Parameters

agent the agent

Returns: for each of the agent's variables, its collection of neighbors

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getNeighborhoods() [3/3]

Map< String, Set< String > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.getNeighborhoods	(	String	agent,
		final boolean	withAnonymVars,
		final boolean	onlyAnonymVars )

Returns the neighborhood of each variable owned by the input agent.

Parameters

agent	the agent
withAnonymVars	if `false`, ignores variables with no specified owner
onlyAnonymVars	if `true`, only considers variables with no specified owner (in which case this superseeds withAnonymVars)

Returns: for each of the agent's variables, its collection of neighbors

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getNeighborhoodSizes() [1/2]

Map< String, Integer > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getNeighborhoodSizes ( )

Returns the number of neighboring variables of all internal variables.

Returns: for each internal variable, its number of neighboring variables

Warning: Ignores variables with no specified owner.

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getNeighborhoodSizes() [2/2]

Map< String, Integer > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getNeighborhoodSizes ( String agent )

Returns the number of neighboring variables of all variables owned by the input agent.

Parameters

agent name of the agent

Returns: for each variable owned by the input agent, its number of neighboring variables

Warning: Ignores variables with no specified owner.

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getNeighborVars() [1/2]

Collection< String > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getNeighborVars ( String var )

Returns the neighbors of the given variable.

Parameters

var	the variable

Returns: the neighbors

Warning: Ignores variables with no specified owner.

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable >.MaxWidthMinDom.getScore().

◆ getNeighborVars() [2/2]

HashSet< String > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.getNeighborVars	(	String	var,
		final boolean	withAnonymVars )

Returns the collection of neighbors of a given variable.

Parameters

var	the name of the variable
withAnonymVars	if `false`, ignores variables with no specified owner

Returns: a collection of neighbor variables of var

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getNumberOfCoordinationConstraints()

int frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getNumberOfCoordinationConstraints ( )

Returns the number of spaces that are shared between different agents.

Author: Brammert Ottens, 6 mrt 2010

Returns: the number of spaces that are shared between different agents

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getOwner()

String frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getOwner ( String var )

Returns the name of the agent owning the input variable.

Parameters

var	the name of the variable

Returns: the owner of the input variable

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.dpop.test.UTILpropagationTest >.computeDFS(), frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable >.factorGraphToDOT(), frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.init(), frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.init(), frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.notifyIn(), frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable >.notifyIn(), and frodo2.algorithms.test.ProblemTest.testGetOwner().

◆ getOwners()

Map< String, String > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getOwners ( )

Returns: for each variable, the name of its owner agent

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getParamUtility()

UtilitySolutionSpace< V, U > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getParamUtility ( Map< String[], BasicUtilitySolutionSpace< V, ArrayList< V > > > assignments )

Computes the total utility of the input assignment to variables, conditioned on the values of parameters.

Parameters

assignments values for variables

Returns: the optimal conditional utility corresponding to the input assignment

◆ getProbabilitySpacePerRandVar()

Map< String, ? extends UtilitySolutionSpace< V, U > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getProbabilitySpacePerRandVar ( )

Returns the probability space of each random variable in the problem.

Returns: the probability space for each random variable

Implemented in frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.

Referenced by frodo2.algorithms.dpop.test.UTILpropagationTest >.Listener.Listener(), frodo2.algorithms.adopt.test.testADOPT.test(), frodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable >.test(), frodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable >.test(), frodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable >.test(), frodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable >.test(), frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest.testRandom(), and frodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable >.testRandom().

◆ getProbabilitySpaces() [1/2]

List< ? extends UtilitySolutionSpace< V, U > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getProbabilitySpaces ( )

Returns the probability spaces in the problem.

Returns: a list of spaces, or null if some information is missing

Implemented in frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.

Referenced by frodo2.algorithms.test.XCSPparserTest.testGetProbabilitySpacesForVar(), frodo2.algorithms.test.XCSPparserTest.testGetSubProblem(), and frodo2.algorithms.test.XCSPparserTest.testSetDomain().

◆ getProbabilitySpaces() [2/2]

List< ? extends UtilitySolutionSpace< V, U > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getProbabilitySpaces ( String var )

Returns the probability spaces involving the input variable.

Parameters

var	the variable of interest

Returns: a list of spaces, or null if some information is missing

Implemented in frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.

◆ getRandVars()

Set< String > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getRandVars ( )

Returns: the random variables

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.dpop.test.UTILpropagationTest >.Listener.Listener(), frodo2.algorithms.adopt.test.testADOPT.test(), frodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable >.test(), frodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable >.test(), frodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable >.test(), frodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable >.test(), frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest.testRandom(), and frodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable >.testRandom().

◆ getSolutionSpaces() [1/6]

List< ? extends UtilitySolutionSpace< V, U > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getSolutionSpaces ( )

Returns the solution spaces in the problem.

Returns: a list of spaces, or null if some information is missing

Warning: Ignores variables with unknown owners.

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getSolutionSpaces() [2/6]

List< ? extends UtilitySolutionSpace< V, U > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getSolutionSpaces ( final boolean withAnonymVars )

Returns the solution spaces in the problem.

Parameters

withAnonymVars whether spaces involving variables with unknown owners should be taken into account

Returns: a list of spaces, or null if some information is missing

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getSolutionSpaces() [3/6]

List< ? extends UtilitySolutionSpace< V, U > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.getSolutionSpaces	(	Set< String >	vars,
		final boolean	withAnonymVars,
		Set< String >	forbiddenVars )

Extracts solution spaces involving the input variables from the constraints in the problem.

Returns: a list of hypercubes, or null if some information is missing in the problem file

Parameters

vars	the variables of interest
withAnonymVars	whether hypercubes involving variables with unknown owners should be taken into account
forbiddenVars	any space involving any of these variables will be ignored

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getSolutionSpaces() [4/6]

List< ? extends UtilitySolutionSpace< V, U > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.getSolutionSpaces	(	String	var,
		final boolean	withAnonymVars )

Extracts solution spaces involving the input variable from the constraints in the problem.

Returns: a list of hypercubes, or null if some information is missing in the problem file

Parameters

var	the variable of interest
withAnonymVars	whether hypercubes involving variables with unknown owners should be taken into account

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getSolutionSpaces() [5/6]

List< ? extends UtilitySolutionSpace< V, U > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.getSolutionSpaces	(	String	var,
		final boolean	withAnonymVars,
		Set< String >	forbiddenVars )

Extracts solution spaces involving the input variable from the constraints in the problem.

Returns: a list of hypercubes, or null if some information is missing in the problem file

Parameters

var	the variable of interest
withAnonymVars	whether hypercubes involving variables with unknown owners should be taken into account
forbiddenVars	any space involving any of these variables will be ignored

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getSolutionSpaces() [6/6]

List< ? extends UtilitySolutionSpace< V, U > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.getSolutionSpaces	(	String	var,
		Set< String >	forbiddenVars )

Returns the solution spaces involving the input variable and none of the forbidden variables.

Parameters

var	the variable of interest
forbiddenVars	any space involving any of these variables will be ignored

Returns: a list of spaces, or null if some information is missing

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getSubProblem()

DCOPProblemInterface< V, U > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getSubProblem ( String agent )

See also: ProblemInterface.getSubProblem(java.lang.String)

Implemented in frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.

◆ getUtility() [1/2]

UtilitySolutionSpace< V, U > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getUtility ( Map< String, V > assignments )

Computes the total utility of the input assignment to variables, ignoring variables with no specified owner.

This methods actually returns a UtilitySolutionSpace. If not all variables in the problem are assigned a value, the space will represent the utility of the assignment, conditioned on the free variables. If all variables are grounded, the method returns a scalar UtilitySolutionSpace.

Parameters

assignments values for variables

Returns: the optimal (possibly conditional) utility corresponding to the input assignment

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable >.notifyIn(), frodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable >.testRandom(), and frodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable >.testRandom().

◆ getUtility() [2/2]

UtilitySolutionSpace< V, U > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.getUtility	(	Map< String, V >	assignments,
		final boolean	withAnonymVars )

Computes the total utility of the input assignment to variables.

This methods actually returns a UtilitySolutionSpace. If not all variables in the problem are assigned a value, the space will represent the utility of the assignment, conditioned on the free variables. If all variables are grounded, the method returns a scalar UtilitySolutionSpace.

Parameters

assignments	values for variables
withAnonymVars	if `false`, ignores variable with no specified owner

Returns: the optimal (possibly conditional) utility corresponding to the input assignment

◆ getVariables() [1/2]

Set< String > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getVariables ( )

Returns: all variables with a known owner

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getVariables() [2/2]

Set< String > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getVariables ( String owner )

Returns the set of variables owned by a given agent.

Parameters

owner the name of the agent; if null, returns all variables with no specified owner

Returns: a set of variables owned by owner

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getVarScopes()

Map< String, Set< String > > frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getVarScopes ( )

Returns: for each anonymous variable, its neighboring agents

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.dpop.test.UTILpropagationTest >.Listener.Listener(), frodo2.algorithms.adopt.test.testADOPT.test(), frodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable >.test(), frodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable >.test(), frodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable >.test(), frodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable >.test(), frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest.testRandom(), and frodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable >.testRandom().

◆ ground()

void frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.ground	(	String	var,
		V	val )

Adds a constraint that enforces that var = val.

Parameters

var	the variable
val	the value

◆ isRandom()

boolean frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.isRandom ( String var )

Returns whether the input variable is defined as a random variable.

Parameters

var	the name of the variable

Returns: true if the input variable is a random variable, false if not or if the variable is unknown

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.test.XCSPparserTest.getExtendedRandNeighbors(), frodo2.algorithms.test.XCSPparserTest.getNeighborhoods(), frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable >.notifyIn(), frodo2.algorithms.test.XCSPparserTest.testGetAgentNeighborhoods(), frodo2.algorithms.test.XCSPparserTest.testGetNbrNeighbors(), frodo2.algorithms.test.XCSPparserTest.testGetNeighborhoods(), frodo2.algorithms.test.XCSPparserTest.testGetNeighborhoodSizes(), frodo2.algorithms.test.XCSPparserTest.testGetNeighborVars(), and frodo2.algorithms.test.XCSPparserTest.testSetDomain().

◆ maximize()

boolean frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.maximize ( )

Returns: true if this is a maximization problem, false otherwise

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable >.computeOptValAndSendVALUEmsgs(), frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.init(), frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable >.MaxSum(), frodo2.algorithms.reformulation.ProblemRescaler >.notifyIn(), frodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable >.notifyIn(), setMaximize(), frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable >.start(), frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable >.start(), and frodo2.algorithms.test.XCSPparserTest.testMaximize().

◆ removeSpace()

boolean frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.removeSpace ( String name )

Removes the space with the given name.

Parameters

name	the name of the space

Returns: true if the space was present and had been removed

Implemented in frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.

◆ rescale()

void frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.rescale	(	U	multiply,
		U	add )

Rescales the problem.

Parameters

multiply	multiplies all costs/utilities by multiply
add	after multiplying all costs/utilities by multiply (if required), adds add

Referenced by frodo2.algorithms.reformulation.ProblemRescaler >.notifyIn().

◆ setDomain()

void frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.setDomain	(	String	var,
		V[]	dom )

Sets the domain of a variable.

Parameters

var	the name of the variable
dom	the domain; if empty, does nothing

Referenced by frodo2.algorithms.test.XCSPparserTest.testSetDomain().

◆ setMaximize()

void frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.setMaximize ( boolean maximize )

Sets whether utility should be maximized, or cost minimized.

Parameters

maximize true iff this should be a maximization problem

Implemented in frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

References maximize().

Referenced by frodo2.algorithms.reformulation.ProblemRescaler >.notifyIn().

Here is the call graph for this function:

◆ setOwner()

boolean frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.setOwner	(	String	var,
		String	owner )

Sets the owner agent for the input variable.

Parameters

var	the variable
owner	the owner

Returns: false if the owner was not changed because the variable does not exist

Implemented in frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.

◆ setProbSpace()

void frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >.setProbSpace	(	String	var,
		Map< V, Double >	prob )

Adds to the problem a probability space for the input random variable.

Parameters

var	random variable
prob	weighted samples

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

src/frodo2/solutionSpaces/DCOPProblemInterface.java

Public Member Functions

Detailed Description

Member Function Documentation

◆ addAgent()

◆ addSolutionSpace()

◆ addUnarySpace()

◆ addVariable() [1/2]

◆ addVariable() [2/2]

◆ getAgentNeighborhoods() [1/2]

◆ getAgentNeighborhoods() [2/2]

◆ getAllVars()

◆ getAnonymNeighborhoods() [1/2]

◆ getAnonymNeighborhoods() [2/2]

◆ getAnonymVars()

◆ getDomain()

◆ getDomainSize()

◆ getExpectedUtility()

◆ getExtVars()

◆ getMyVars()

◆ getNbrIntVars()

◆ getNbrNeighbors() [1/2]

◆ getNbrNeighbors() [2/2]

◆ getNbrVars() [1/2]

◆ getNbrVars() [2/2]

◆ getNeighborhoods() [1/3]

◆ getNeighborhoods() [2/3]

◆ getNeighborhoods() [3/3]

◆ getNeighborhoodSizes() [1/2]

◆ getNeighborhoodSizes() [2/2]

◆ getNeighborVars() [1/2]

◆ getNeighborVars() [2/2]

◆ getNumberOfCoordinationConstraints()

◆ getOwner()

◆ getOwners()

◆ getParamUtility()

◆ getProbabilitySpacePerRandVar()

◆ getProbabilitySpaces() [1/2]

◆ getProbabilitySpaces() [2/2]

◆ getRandVars()

◆ getSolutionSpaces() [1/6]

◆ getSolutionSpaces() [2/6]

◆ getSolutionSpaces() [3/6]

◆ getSolutionSpaces() [4/6]

◆ getSolutionSpaces() [5/6]

◆ getSolutionSpaces() [6/6]

◆ getSubProblem()

◆ getUtility() [1/2]

◆ getUtility() [2/2]

◆ getVariables() [1/2]

◆ getVariables() [2/2]

◆ getVarScopes()

◆ ground()

◆ isRandom()

◆ maximize()

◆ removeSpace()

◆ rescale()

◆ setDomain()

◆ setMaximize()

◆ setOwner()

◆ setProbSpace()