Game-Theoretic Learning and Distributed Optimization in Memoryless Multi-Agent Systems
☆☆☆☆☆
(0 reviews)
Lowest price (incl. delivery)
57,79 USD
Typical price470,40 PLN
Lowest (90 days)34,99 PLN
Offers7
Last updatedمنذ أسبوع
Price history (90 days)
Full history
2026-08-08
2026-08-15
| تاريخ التحديث | السعر |
|---|---|
| 2026-08-08 | 42,79 |
| 2026-08-14 | 34,99 |
| 2026-08-15 | 51,99 |
| البائع | Product price | Delivery | الإجمالي | التوفر | Updated | |
|---|---|---|---|---|---|---|
| SP SpringerNatureLink Shop INT | 42,79 USD | 15,00 USD | 57,79 USD | متوفر | منذ أسبوع | View offer |
| SP SpringerNatureLink Shop INT | 7 149,00 JPY | 29,00 JPY | 7 178,00 JPY | متوفر | منذ أسبوع | View offer |
| SP Springer Nature Author | 7 149,00 JPY | 25,00 JPY | 7 174,00 JPY | متوفر | منذ أسبوع | View offer |
| SP SpringerNatureLink Shop INT | 49,99 USD | 19,00 USD | 68,99 USD | متوفر | منذ أسبوع | View offer |
| SP SpringerNatureLink Shop INT | 54,99 USD | 29,00 USD | 83,99 USD | متوفر | منذ أسبوع | View offer |
| SP SpringerNatureLink Shop INT | 54,99 USD | 29,00 USD | 83,99 USD | متوفر | منذ أسبوع | View offer |
| SP SpringerNatureLink Shop INT | 59,00 EUR | free | 59,00 EUR | متوفر | منذ أسبوع | View offer |
قد تتغيّر الأسعار والتوفر. آخر تحديث: 08.08.2026 23:09.
0,0
☆☆☆☆☆
0 reviews
5★
0%
4★
0%
3★
0%
2★
0%
1★
0%
Product reviews
No reviews yet — be the first!
This book presents new efficient methods for optimization in realistic large-scale, multi-agent systems. These methods do not require the agents to have the full information about the system, but instead allow them to make their local decisions based only on the local information, possibly obtained during communication with their local neighbors. The book, primarily aimed at researchers in optimization and control, considers three different information settings in multi-agent systems: oracle-based, communication-based, and payoff-based. For each of these information types, an efficient optimization algorithm is developed, which leads the system to an optimal state. The optimization problems are set without such restrictive assumptions as convexity of the objective functions, complicated communication topologies, closed-form expressions for costs and utilities, and finiteness of the system’s state space.