Optimal Distributed Uplink Channel Allocation: A Constrained MDP Formulation

DOI10.1007/978-0-8176-8089-3_21zbMath1218.90053OpenAlexW2186812901MaRDI QIDQ5198538

Vivek S. Borkar, Joy Kuri

Publication date: 8 August 2011

Published in: Annals of the International Society of Dynamic Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-8176-8089-3_21

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Markov and semi-Markov decision processes (90C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An actor-critic algorithm for constrained Markov decision processes
• Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
• Learning Algorithms for Markov Decision Processes with Average Cost
• Linear Programming and Sequential Decisions
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Control of Markov Chains with Long-Run Average Cost Criterion: The Dynamic Programming Equations
• Ergodic Control of Markov Chains with Constraints—the General Case
• Structural Properties of Optimal Transmission Policies Over a Randomly Varying Channel
• Control of Mobile Communication Systems With Time-Varying Channels via Stability Methods
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Envelope Theorems for Arbitrary Choice Sets

This page was built for publication: Optimal Distributed Uplink Channel Allocation: A Constrained MDP Formulation