Optimal Utility Design of Greedy Algorithms in Resource Allocation Games

Designing fast, distributed algorithms for multiagent problems is vital for many novel application domains. Greedy algorithms have been shown in many multiagent contexts to be an efficient approach to arrive at good solutions quickly. In this work, we ask the following: Is there any way to improve t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on automatic control Jg. 69; H. 10; S. 6592 - 6604
Hauptverfasser:	Konda, Rohit, Chandan, Rahul, Grimsman, David, Marden, Jason R.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.10.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithm design Algorithm design and theory Algorithms Design optimization Distributed algorithms distributed systems Game theory Greedy algorithms Multiagent systems optimization Performance enhancement Resource allocation Resource management Wireless communication
ISSN:	0018-9286, 1558-2523
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!