A solution to a StochDCOP, including the expected and worst-case utilities. More...

Inheritance diagram for frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable >.StochSolution< V, U >:

[legend]

Public Member Functions
	StochSolution (int nbrVariables, U trueUtil, U reportedUtil, U expectedUtil, U worstUtil, U probOfOptimality, double centralization, Map< String, V > assignments, int nbrMsgs, TreeMap< MessageType, Integer > msgNbrs, TreeMap< Object, Integer > msgsNbrsSentPerAgent, TreeMap< Object, Integer > msgsNbrsReceivedPerAgent, long totalMsgSize, TreeMap< MessageType, Long > msgSizes, TreeMap< Object, Long > msgSizesSentPerAgent, TreeMap< Object, Long > msgSizesReveivedPerAgent, long maxMsgSize, TreeMap< MessageType, Long > maxMsgSizes, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int treeWidth)
	Constructor.
U	getExpUtil ()
U	getWorstUtil ()
U	getProbOfOptimality ()
double	getCentralization ()
String	toString ()
Public Member Functions inherited from frodo2.algorithms.Solution< V, U >
	Solution (U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, long totalMsgSize, long maxMsgSize, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes)
	Constructor.
	Solution (int nbrVariables, U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, long totalMsgSize, long maxMsgSize, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int numberOfCoordinationConstraints)
	Constructor.
	Solution (int nbrVariables, U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, long totalMsgSize, long maxMsgSize, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int numberOfCoordinationConstraints, int treeWidth)
	Constructor.
	Solution (U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, TreeMap< MessageType, Integer > msgNbrs, TreeMap< Object, Integer > msgsNbrsSentPerAgent, TreeMap< Object, Integer > msgsNbrsReceivedPerAgent, long totalMsgSize, TreeMap< MessageType, Long > msgSizes, TreeMap< Object, Long > msgSizesSentPerAgent, TreeMap< Object, Long > msgSizesReveivedPerAgent, long maxMsgSize, TreeMap< MessageType, Long > maxMsgSizes, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes)
	Constructor.
	Solution (int nbrVariables, U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, TreeMap< MessageType, Integer > msgNbrs, TreeMap< Object, Integer > msgsNbrsSentPerAgent, TreeMap< Object, Integer > msgsNbrsReceivedPerAgent, long totalMsgSize, TreeMap< MessageType, Long > msgSizes, TreeMap< Object, Long > msgSizesSentPerAgent, TreeMap< Object, Long > msgSizesReveivedPerAgent, long maxMsgSize, TreeMap< MessageType, Long > maxMsgSizes, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int numberOfCoordinationConstraints)
	Constructor.
	Solution (int nbrVariables, U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, TreeMap< MessageType, Integer > msgNbrs, TreeMap< Object, Integer > msgsNbrsSentPerAgent, TreeMap< Object, Integer > msgsNbrsReceivedPerAgent, long totalMsgSize, TreeMap< MessageType, Long > msgSizes, TreeMap< Object, Long > msgSizesSentPerAgent, TreeMap< Object, Long > msgSizesReveivedPerAgent, long maxMsgSize, TreeMap< MessageType, Long > maxMsgSizes, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int treeWidth, int numberOfCoordinationConstraints)
	Constructor.
	Solution (int nbrVariables, U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, TreeMap< MessageType, Integer > msgNbrs, TreeMap< Object, Integer > msgsNbrsSentPerAgent, TreeMap< Object, Integer > msgsNbrsReceivedPerAgent, long totalMsgSize, TreeMap< MessageType, Long > msgSizes, TreeMap< Object, Long > msgSizesSentPerAgent, TreeMap< Object, Long > msgSizesReveivedPerAgent, long maxMsgSize, TreeMap< MessageType, Long > maxMsgSizes, long ncccCount, long timeNeeded, long cumulativelTime, HashMap< String, Long > moduleEndTimes, int treeWidth, int numberOfCoordinationConstraints)
	Constructor.
U	getReportedUtil ()
U	getUtility ()
void	setUtility (U util)
	Sets the utility.
Map< String, V >	getAssignments ()
long	getNcccCount ()
int	getNbrMsgs ()
void	setNbrMsgs (int nbrMsgsNew)
	Sets the total number of messages.
long	getTotalMsgSize ()
long	getMaxMsgSize ()
void	setTotalMsgSize (long totalMsgSizeNew)
	Sets the total amount of information exchanged.
long	getTimeNeeded ()
long	getTotalTime ()
void	setTimeNeeded (long timeNeededNew)
	Sets the total runtime.
HashMap< String, Long >	getTimesNeeded ()
TreeMap< MessageType, Long >	getMsgSizes ()
TreeMap< MessageType, Long >	getMaxMsgSizes ()
TreeMap< MessageType, Integer >	getMsgNbrs ()
int	getTreeWidth ()
int	getNumberOfCoordinationConstraints ()
int	getNbrVariables ()
String	toLineString ()

Private Attributes
U	worstUtil
	The worst-case utility.
U	expectedUtil
	The expected utility.
U	probOfOptimality
	The total probability of the scenarios for which this solution is optimal.
double	centralization
	The level of centralization.

Additional Inherited Members
Protected Attributes inherited from frodo2.algorithms.Solution< V, U >
U	reportedUtil
	The reported utility of the solution.
U	trueUtil
	The true utility of the solution.
Map< String, V >	assignments
	For each variable, its assignment in the solution found to the problem.
long	ncccCount
	The number of ncccs used.
long	timeNeeded
	The time needed to solve the problem.
long	cumulativeTime
	The cumulative time needed for all agents to find a solution.
HashMap< String, Long >	moduleEndTimes
	For each module in the algorithm, the time at which it finished.
int	nbrMsgs
	The number of messages sent by the algorithm.
long	totalMsgSize
	The total amount of information sent by the algorithm (in bytes).
long	maxMsgSize
	The size (in bytes) of the largest message.
TreeMap< MessageType, Integer >	msgNbrs
	The total number of messages that has been sent per message type.
TreeMap< MessageType, Long >	msgSizes
	The total amount of information that has been sent per message type.
TreeMap< MessageType, Long >	maxMsgSizes
	For each message type, the size (in bytes) of the largest message of that type.
int	treeWidth = -1
	The tree width of the tree on which the algorithm has run.

Detailed Description

A solution to a StochDCOP, including the expected and worst-case utilities.

Author: Thomas Leaute

Parameters

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

Constructor & Destructor Documentation

◆ StochSolution()

frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.StochSolution< V, U >.StochSolution	(	int	nbrVariables,
		U	trueUtil,
		U	reportedUtil,
		U	expectedUtil,
		U	worstUtil,
		U	probOfOptimality,
		double	centralization,
		Map< String, V >	assignments,
		int	nbrMsgs,
		TreeMap< MessageType, Integer >	msgNbrs,
		TreeMap< Object, Integer >	msgsNbrsSentPerAgent,
		TreeMap< Object, Integer >	msgsNbrsReceivedPerAgent,
		long	totalMsgSize,
		TreeMap< MessageType, Long >	msgSizes,
		TreeMap< Object, Long >	msgSizesSentPerAgent,
		TreeMap< Object, Long >	msgSizesReveivedPerAgent,
		long	maxMsgSize,
		TreeMap< MessageType, Long >	maxMsgSizes,
		long	ncccCount,
		long	timeNeeded,
		HashMap< String, Long >	moduleEndTimes,
		int	treeWidth )

Constructor.

Parameters

nbrVariables	the total number of variables in the problem
trueUtil	the true utility, if it does not depend on anonymous variables
reportedUtil	the total utility reported by the roots
expectedUtil	the expected utility
worstUtil	the worst-case utility
probOfOptimality	the total probability of the scenarios for which this solution is optimal
centralization	the level of centralization incurred by using a consistent DFS (for the Comp- approach)
assignments	the optimal assignments
nbrMsgs	the total number of messages sent
msgNbrs	The number of messages sent per message type
msgsNbrsSentPerAgent	the number of message sent by each agent
msgsNbrsReceivedPerAgent	the number of messages received by each agent
totalMsgSize	the total message size
msgSizes	The amount of information sent per message type
msgSizesSentPerAgent	the amount of information sent by each agent, in bytes
msgSizesReveivedPerAgent	the amount of information received by each agent, in bytes
maxMsgSize	the size (in bytes) of the largest message
maxMsgSizes	for each message type, the size (in bytes) of the largest message of that type
ncccCount	the ncccs used
timeNeeded	the time needed to solve the problem
moduleEndTimes	each module's end time
treeWidth	the width of the tree on which the algorithm has run

Member Function Documentation

◆ getCentralization()

double frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable >.StochSolution< V, U >.getCentralization ( )

Returns: the level of centralization

◆ getExpUtil()

U frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable >.StochSolution< V, U >.getExpUtil ( )

Returns: the expected utility

◆ getProbOfOptimality()

U frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable >.StochSolution< V, U >.getProbOfOptimality ( )

Returns: the total probability of the scenarios for which this solution is optimal

◆ getWorstUtil()

U frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable >.StochSolution< V, U >.getWorstUtil ( )

Returns: the worst-case utility

◆ toString()

String frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable >.StochSolution< V, U >.toString ( )

See also: Solution.toString()

Reimplemented from frodo2.algorithms.Solution< V, U >.

Member Data Documentation

◆ centralization

double frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable >.StochSolution< V, U >.centralization

private

The level of centralization.

Referenced by StochSolution().

◆ expectedUtil

U frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable >.StochSolution< V, U >.expectedUtil

private

The expected utility.

Referenced by StochSolution().

◆ probOfOptimality

U frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable >.StochSolution< V, U >.probOfOptimality

private

The total probability of the scenarios for which this solution is optimal.

Referenced by StochSolution().

◆ worstUtil

U frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable >.StochSolution< V, U >.worstUtil

private

The worst-case utility.

Referenced by StochSolution().

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

src/frodo2/algorithms/dpop/stochastic/E_DPOPsolver.java

Public Member Functions

Private Attributes

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ StochSolution()

Member Function Documentation

◆ getCentralization()

◆ getExpUtil()

◆ getProbOfOptimality()

◆ getWorstUtil()

◆ toString()

Member Data Documentation

◆ centralization

◆ expectedUtil

◆ probOfOptimality

◆ worstUtil