random_discrete_domains
- negmas.tournaments.random_discrete_domains(issues, partners, n_negotiators=2, positions=None, normalized=True, ufun_type=<class 'negmas.preferences.crisp.linear.LinearUtilityFunction'>, roles=None, partner_extraction_method='round-robin')[source]
Generates an infinite sequence of random discrete domains
- Parameters
issues (
List
[Union
[Issue
,int
,Tuple
[int
,int
]]]) – A list defining the issue space. Each element can be anIssue
object, an integer (defining the number of outcomes) or a tuple of two integers (defining the minimum and maximum number of outcomes for the issue).partners (
List
[Negotiator
]) – A list ofNegotiator
types from which partners are extracted. The system will extractn_negotiators
- 1 partners for each domain.n_negotiators – The number of negotiators in each negotiation.
positions (
Union
[Tuple
[int
,int
],int
,None
]) – 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 (
Optional
[List
[str
]]) – The roles of then_negotiators
(including the competitor) in negotiationspartner_extraction_method –
The method used to create partners for negotaitions from the given
partners
list:round-robin: will extract overalapping
n_negotiators
- 1 setspermutations: Will use all
n_negotaitors
- 1 permutationsrandom: Will sample randm sets of
n_negotiators
- 1 partnerscompinations: Will use all
n_negotiators
- 1 combinations
- Return type