On the public citation graph
Flow control using the theory of zero sum Markov games
0 signed · 63 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0166-5316(91)90054-7openalex-snapshot
Optimal decentralized flow control of Markovian queueing networks with multiple controllers
inferredcites →https://doi.org/10.1109/cdc.1982.268385openalex-snapshot
Control techniques and performance models for circuit switched networks
inferredcites →https://doi.org/10.1109/tac.1983.1103166openalex-snapshot
Optimal flow control of a class of queueing networks in equilibrium
inferredcites →https://doi.org/10.1287/opre.30.5.998openalex-snapshot
Generalized Network Problems Yielding Totally Balanced Games
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nla.1815openalex-snapshot
Multigrid methods for two‐player zero‐sum stochastic games
inferred← citeshttps://doi.org/10.1007/0-8176-4429-6_19openalex-snapshot
Applications of Dynamic Games in Queues
inferred← citeshttps://doi.org/10.1007/978-1-4612-1592-9_9openalex-snapshot
A Markov Game Approach for Optimal Routing Into a Queuing Network
inferred← citeshttps://doi.org/10.1007/978-1-4615-0805-2_16openalex-snapshot
Applications of Markov Decision Processes in Communication Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72863-4_46openalex-snapshot
A Cooperative Game Theory Based Coalitional Agent Negotiation Model in Network Service
inferred← citeshttps://doi.org/10.1007/978-3-642-40543-3_17openalex-snapshot
Equilibrium Traffic Flow Assignment in Case of Two Navigation Providers
inferred← citeshttps://doi.org/10.1007/bf01149169openalex-snapshot
Zero-sum Markov games and worst-case optimal control of queueing systems
inferred← citeshttps://doi.org/10.1007/bf01149170openalex-snapshot
S-modular games, with queueing applications
inferred← citeshttps://doi.org/10.1007/bf01206560openalex-snapshot
Non zero-sum stochastic games in admission, service and routing control in queueing systems
inferred← citeshttps://doi.org/10.1007/s13235-019-00317-zopenalex-snapshot
Nonzero-Sum Stochastic Games with Probability Criteria
inferred← citeshttps://doi.org/10.1016/j.asoc.2006.02.005openalex-snapshot
A robust Markov game controller for nonlinear systems
inferred← citeshttps://doi.org/10.1016/j.asoc.2009.10.020openalex-snapshot
Synergizing reinforcement learning and game theory—A new direction for control
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.109685openalex-snapshot
Bounding fixed points of set-based Bellman operator and Nash equilibria of stochastic games
inferred← citeshttps://doi.org/10.1016/j.cor.2004.06.005openalex-snapshot
A survey on networking games in telecommunications
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)39622-2openalex-snapshot
Policy Scheduling and Queuing in Neural Network
inferred← citeshttps://doi.org/10.1017/s0021900200016971openalex-snapshot
Avoiding the Braess paradox in non-cooperative networks
inferred← citeshttps://doi.org/10.1023/a:1016770831869openalex-snapshot
Atomic Resource Sharing in Noncooperative Networks
inferred← citeshttps://doi.org/10.1023/a:1019133809177openalex-snapshot
Dynamic service sharing with heterogeneous preferences
inferred← citeshttps://doi.org/10.1051/cocv/2020029openalex-snapshot
Zero-sum risk-sensitive stochastic differential games with reflecting diffusions in the orthant
inferred← citeshttps://doi.org/10.1080/07362994.2025.2470941openalex-snapshot
Zero-sum games for piecewise deterministic Markov decision processes with risk-sensitive finite-horizon cost criterion
inferred← citeshttps://doi.org/10.1080/15326349808807514openalex-snapshot
On submodular value functions and complex dynamic programming
inferred← citeshttps://doi.org/10.1109/49.414643openalex-snapshot
Architecting noncooperative networks
inferred← citeshttps://doi.org/10.1109/9.557575openalex-snapshot
Capacity allocation under noncooperative routing
inferred← citeshttps://doi.org/10.1109/90.554730openalex-snapshot
Achieving network optima using Stackelberg routing strategies
inferred← citeshttps://doi.org/10.1109/acc.2001.946017openalex-snapshot
Preliminary results in routing games
inferred← citeshttps://doi.org/10.1109/cdc.1993.325837openalex-snapshot
Stochastic games and flow control models
inferred← citeshttps://doi.org/10.1109/cdc.1997.657873openalex-snapshot
Avoiding Design Paradoxes in Noncooperative Networks
inferred← citeshttps://doi.org/10.1109/cscwd.2006.253250openalex-snapshot
A Cooperative Game Model for Agent Negotiation in Network Service
inferred← citeshttps://doi.org/10.1109/icca51439.2020.9264567openalex-snapshot
Air combat autonomous maneuver decision for one-on-one within visual range engagement base on robust multi-agent reinforcement learning
inferred← citeshttps://doi.org/10.1109/infcom.1995.515922openalex-snapshot
The designer's perspective to noncooperative networks
inferred← citeshttps://doi.org/10.1109/infcom.1996.493075openalex-snapshot
The role of the manager in a noncooperative network
inferred← citeshttps://doi.org/10.1109/infcom.1997.631115openalex-snapshot
Atomic resource sharing in noncooperative networks
inferred← citeshttps://doi.org/10.1109/infcom.1999.751477openalex-snapshot
Best-effort resource sharing by users with QoS requirements
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062065openalex-snapshot
Protecting Against Network Infections: A Game Theoretic Perspective
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062080openalex-snapshot
Topology Design and Control: A Game-Theoretic Perspective
inferred← citeshttps://doi.org/10.1109/infocom.2006.226openalex-snapshot
Bottleneck Routing Games in Communication Networks
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218557openalex-snapshot
Formation games of reliable networks
inferred← citeshttps://doi.org/10.1109/jsac.2007.070811openalex-snapshot
Bottleneck Routing Games in Communication Networks
inferred← citeshttps://doi.org/10.1109/tac.2016.2598476openalex-snapshot
Decentralized Q-Learning for Stochastic Teams and Games
inferred← citeshttps://doi.org/10.1109/tg.2020.3005214openalex-snapshot
Heuristic Search Value Iteration for Zero-Sum Stochastic Games
inferred← citeshttps://doi.org/10.1109/tnet.2013.2254125openalex-snapshot
Topology Design of Communication Networks: A Game-Theoretic Perspective
inferred← citeshttps://doi.org/10.1137/s036301299325534xopenalex-snapshot
Approximations in Dynamic Zero-Sum Games I
inferred← citeshttps://doi.org/10.1137/s0363012994272460openalex-snapshot
Approximations in Dynamic Zero-Sum Games II
inferred← citeshttps://doi.org/10.1145/2600057.2602862openalex-snapshot
Network formation games with heterogeneous players and the internet structure
inferred← citeshttps://doi.org/10.1186/s40294-016-0026-7openalex-snapshot
Game theory models for communication between agents: a review
inferred← citeshttps://doi.org/10.1239/jap/1032374242openalex-snapshot
Avoiding the Braess paradox in non-cooperative networks
inferred← citeshttps://doi.org/10.1287/moor.22.3.588openalex-snapshot
Contraction Conditions for Average and α-Discount Optimality in Countable State Markov Games with Unbounded Rewards
inferred← citeshttps://doi.org/10.1287/opre.1110.0931openalex-snapshot
Discounted Robust Stochastic Games and an Application to Queueing Control
inferred← citeshttps://doi.org/10.1287/opre.46.6.776openalex-snapshot
Individual Equilibrium and Learning in Processor Sharing Systems
inferred← citeshttps://doi.org/10.3390/app7111138openalex-snapshot
Network Defense Strategy Selection with Reinforcement Learning and Pareto Optimization
inferred← citeshttps://doi.org/10.3846/mla.2012.05openalex-snapshot
COMPOSITE DOS ATTACK MODEL / JUNGTINIS DOS ATAKŲ MODELIS
inferred← citeshttps://doi.org/10.3934/mcrf.2023003openalex-snapshot
Zero-sum stochastic games in continuous-time with risk-sensitive average cost criterion on a countable state space
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0580openalex-snapshot
Value Function Approximation in Zero-Sum Markov Games
inferred← citeshttps://doi.org/10.48550/arxiv.1604.08179openalex-snapshot
Strategic Formation of Heterogeneous Networks
inferred← citeshttps://doi.org/10.5121/ijasuc.2011.2206openalex-snapshot
Performance Comparison of QOS Metrics for a Distributed Pricing Scheme
inferred← citeshttps://doi.org/10.5121/ijwmn.2011.3303openalex-snapshot
Convergence Performance Of Sinr And Sir Utilities For A Distributed Resource Allocation Game
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.