| Autor: |
Malafeev, O., Parfenov, A., Zaitseva, I., Shlaev, D., Orel, Yu. |
| Předmět: |
|
| Zdroj: |
AIP Conference Proceedings; 2023, Vol. 2910 Issue 1, p1-4, 4p |
| Abstrakt: |
An atomic routing game with limited capacities is considered. Different players in this game have different amounts of transported production and different cost functions. Algorithms finding Nash equilibrium are constructed. These algorithms are compared by time complexity. A numerical example is solved. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
