The final submission deadline in your time-zone is: [i.e. ]
NEWS
- 2023.06.07 The final results of the SCML 2023 competition were announced at AAMAS 2023. Please check them out here
This is the home of the Supply Chain Management League (SCML) one of ANAC 2024 leagues
The main motivation behind the SCM league is to increase the relevance of automated negotiation research by focusing on real-world scenarios that are characterized by situated negotiations, and complex dynamic utility functions.
The agent needs not only decide how to negotiate in a predefined single negotiation session, but when to join negotiations, and how to coordinate the behavior of its negotiators across multiple concurrent negotiations.
The live competition is run using fewer configurations than the official competition to facilitate faster feedback when submitting new agents. This may lead to different results in the official competition.
Changes from SCML 2023
The collusion track will be cancelled, the standard track will be simplified and the oneshot track will not change.
Getting started and getting help
- The first thing you need to do is to read the game overview for the track you plan to submit to. You can check this year's rules for the one shot track and/or the standard track.
- If you are not registered here, do so to received updates and be able to submit your agents later here.
- After deciding which track(s) to participate in, check there detailed description ( OneShot or Standard).
- Next, Check the tutorials. You can find video tutorials and consult the documentation and we are happy to see you joining the discussions.
- Next, Download the appropriate skeleton (OneShot or Standard) and test it. You will find a full description on how to do that in the README as well as the docstring on top of myagent.py in the skeleton .
- Happy hacking :-) If you have any questions, bug reports, feature requests, etc, you can open an issue on the SCML GitHub page
Sponsors
Links
Description:
Templates (OneShot):
Templates (Standard):
Discussions:
Source Code: