random_discrete_domains(issues: List[Union[negmas.outcomes.Issue, int, Tuple[int, int]]], partners: List[negmas.negotiators.Negotiator], n_negotiators=2, positions: Optional[Union[int, Tuple[int, int]]] = None, normalized=True, ufun_type=<class 'negmas.utilities.linear.LinearUtilityFunction'>, roles: Optional[List[str]] = None, partner_extraction_method='round-robin') → Generator[
negmas.situated.NegDomain, None, None]¶
Generates an infinite sequence of random discrete domains
issues – A list defining the issue space. Each element can be an
Issueobject, an integer (defining the number of outcomes) or a tuple of two integers (defining the minimum and maximum number of outcomes for the issue).
n_negotiators – The number of negotiators in each negotiation.
positions – The positions at which the competitors will be added in all negotiations.
normalized – Will the ufuns generated by normalized
ufun_type – Type of the utility function to use.
roles – The roles of the
n_negotiators(including the competitor) in negotiations
The method used to create partners for negotaitions from the given