RandomElicitor

class negmas.elicitation.RandomElicitor(strategy: EStrategy, user: User, deep_elicitation=True, true_utility_on_zero_cost=False, base_negotiator: negmas.sao.negotiators.SAONegotiator = <negmas.sao.negotiators.AspirationNegotiator object>, opponent_model_factory: Optional[Callable[[AgentMechanismInterface], DiscreteAcceptanceModel]] = <function RandomElicitor.<lambda>>, single_elicitation_per_round=False, **kwargs)[source]

Bases: negmas.elicitation.BasePandoraElicitor

Uses a random index instead of the optimal z-index used by the Pandora’s box solution.

Methods Summary

init_unknowns()

Initializes the unknowns list which is a list of Tuples [-u(o), o] for o in outcomes.

update_best_offer_utility(outcome, u)

Updates the unknown list (and makes sure it is a heap) given the given utility value for the given outcome.

Methods Documentation

init_unknowns()None[source]

Initializes the unknowns list which is a list of Tuples [-u(o), o] for o in outcomes.

update_best_offer_utility(outcome: Union[negmas.outcomes.OutcomeType, Tuple[Union[int, float, str, list]], Dict[Union[int, str], Union[int, float, str, list]]], u: Union[negmas.helpers.Distribution, float])[source]

Updates the unknown list (and makes sure it is a heap) given the given utility value for the given outcome.