anac2019_world

scml.scml2019.anac2019_world(competitors=(), params=(), randomize=True, log_file_name=None, name=None, agent_names_reveal_type=False, n_intermediate=(1, 4), n_miners=5, n_factories_per_level=11, n_agents_per_competitor=1, n_consumers=5, n_lines_per_factory=10, guaranteed_contracts=False, use_consumer=True, max_insurance_premium=inf, n_retrials=5, negotiator_type='negmas.sao.AspirationNegotiator', transportation_delay=0, default_signing_delay=0, max_storage=9223372036854775807, consumption_horizon=15, consumption=(3, 5), negotiation_speed=21, neg_time_limit=240, neg_n_steps=20, n_steps=100, time_limit=8100, n_default_per_level=5, compact=False, **kwargs)[source]

Creates a world compatible with the ANAC 2019 competition. Note that

Parameters

  • n_agents_per_competitor – Number of instantiations of each competing type.

  • name (Optional[str]) – SCML2020World name to use

  • agent_names_reveal_type (bool) – If true, a snake_case version of the agent_type will prefix agent names

  • randomize (bool) – If true, managers are assigned to factories randomly otherwise in the order

  • giving (they are) –

  • n_intermediate (Tuple[int, int]) –

  • n_default_per_level (int) –

  • competitors (Sequence[Union[str, Type[FactoryManager]]]) – A list of class names for the competitors

  • params (Sequence[Dict[str, Any]]) – A list of dictionaries giving parameters to pass to the competitors

  • n_miners – number of miners of the single raw material

  • n_factories_per_level – number of factories at every production level

  • n_consumers – number of consumers of the final product

  • n_steps – number of simulation steps

  • n_lines_per_factory – number of lines in each factory

  • negotiation_speed – The number of negotiation steps per simulation step. None means infinite

  • default_signing_delay – The number of simulation between contract conclusion and signature

  • neg_n_steps – The maximum number of steps of a single negotiation (that is double the number of rounds)

  • neg_time_limit – The total time-limit of a single negotiation

  • time_limit – The total time-limit of the simulation

  • transportation_delay – The transportation delay

  • n_retrials – The number of retrials the Miner and GreedyFactoryManager will try if negotiations fail

  • max_insurance_premium – The maximum insurance premium accepted by GreedyFactoryManager (-1 to disable)

  • use_consumer – If true, the GreedyFactoryManager will use an internal consumer for buying its needs

  • guaranteed_contracts – If true, the GreedyFactoryManager will only sign contracts that it can guaratnee not to

  • break. –

  • consumption_horizon – The number of steps for which Consumer publishes CFP s

  • consumption – The consumption schedule will be sampled from a uniform distribution with these limits inclusive

  • log_file_name (Optional[str]) – File name to store the logs

  • negotiator_type (str) – The negotiation factory used to create all negotiators

  • max_storage – maximum storage capacity for all factory managers If None then it is unlimited

  • compact (bool) – If True, then compact logs will be created to reduce memory footprint

  • kwargs – key-value pairs to be passed as argument to chain_world() and then to SCML2019World()

Return type

SCML2019World

Returns

SCML2019World ready to run

Remarks:

  • Every production level n has one process only that takes n steps to complete