negmas.elicitation Package
” The interface to all negotiators capable of eliciting user preferences before , and during negotiations.
Functions
|
Returns the lower bound of a Value |
|
Returns the lower bound of an iterable of Value(s) |
|
Returns the difference between the upper and lower bounds of a Value |
|
Returns the upper bound of a Value |
|
Returns the upper bounds of an Iterble of Values |
|
Returns the index of the maximum |
|
Returns the index of the minimum |
|
Returns the index of the minimum |
|
Gets the possible outcomes for the next ask with its cost. |
|
Gets all queries that could be asked for that outcome until an exact value of ufun is found. |
|
Implements Weitzman's 1979 Bandora's Box index calculation. |
Classes
|
A proxy for a user that have some true utilities which can be elicited. |
|
Abstract base class for all representations of users used for elicitation |
|
|
|
Some constraint on allowable utility values for given outcomes. |
|
Constraints that do not affect the marginals of any outcomes. |
|
Constraints the utilities of given outcomes to be in ascending order |
|
Constraints the utility of given two outcomes (must be exactly two) to satisfy the given operation (e.g. >, <). |
|
Constraints the utility of each of the given outcomes to lie within the given range |
|
|
|
|
|
|
|
|
|
|
|
A dummy elicitation algorithm that does not do any elicitation. |
|
An elicitor that does not need to do any elicitation because it has full access to the user ufun. |
|
The base class of all Pandora's box based algorithms. |
|
Implements the original [Baarslag and Gerding]_'s Pandora's box based elicitation algorithm (when used with the default parameters). |
|
Same as |
|
Does full deep elicitation in the first call to |
|
Uses a random index instead of the optimal z-index used by the Pandora's box solution. |
|
Same as |
|
Same as |
|
Same as |
|
Same as |
|
Same as |
|
Same as |
|
Base class for all value of information (VOI) elicitation algorithms |
|
The Optimal Querying Agent (OQA) proposed by [Baarslag and Kaisers]_ |
|
FastVOI algorithm proposed by Mohammad and Nakadai [MN2018] |
|
A dummy VOI Elicitation Agent. |
|
Optimal VOI elicitor proposed by [Mohammad and Nakadai]_ |
alias of |
|
|