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...

Full description

Bibliographic Details

Published in:	IEEE transactions on automatic control Vol. 69; no. 10; pp. 6592 - 6604
Main Authors:	Konda, Rohit, Chandan, Rahul, Grimsman, David, Marden, Jason R.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.10.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!