The University of Melbourne Library Digital Repository
metadata only
An Information Analysis of Iterative Algorithms for Network Utility Maximization and Strategic Games
A variety of resource allocation problems on networked systems, for example, those in cyber-physical systems or Internet-of-things applications, require distributed solution methods. Modern distributed algorithms usually require bandwidth-limited digital communication between the system and its user
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Fundamental Limit in Decentralized Decision-Making#984397
- Lecture Notes on Applied Optimization#1085070
- Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games#1066569
- Solving concentrator location and terminal assignment problems using simulated annealing#1020417
- Network Optimization#67091
Record · ID 1005562
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive