Resource Allocation Under Uncertainty Using the Maximum Entropy Principle

DOI10.1109/TIT.2005.859277MaRDI QIDQ3547088zbMATH OpenOpenAlexFDO

Authors

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2005.859277

zbMATH Keywords

Maximum entropymultiuser diversityresource allocationschedulinguncertainty

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Communication theory (94A05) Measures of information, entropy (94A17)

Recommendations

• Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities
• Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
• Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacity
• Optimal Distributed Uplink Channel Allocation: A Constrained MDP Formulation
• Resource allocation -- WiMAX systems

Cited in

(9)

• Two schemes for information acquisition: An entropic assessment
• Fair division with uncertain needs
• Dynamic metabolic resource allocation based on the maximum entropy principle
• Equal-quantile rules in resource allocation with uncertain needs
• Constrained Sequential Resource Allocation and Guessing Games
• QoS rate allocation in computer networks under uncertainty
• Information and memory in dynamic resource allocation
• Resource allocation under uncertainty
• Resource allocation in stochastic, finite-capacity, multi-project systems through the cross entropy methodology

This page was built for publication: Resource Allocation Under Uncertainty Using the Maximum Entropy Principle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547088)