A survey on networking games in telecommunications

DOI10.1016/j.cor.2004.06.005zbMath1116.91310OpenAlexW2004224914MaRDI QIDQ2567161

Tania Jiménez, Laura Wynter, Eitan Altman, T. Boulogne, Rachid El-Azouzi

Publication date: 29 September 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2004.06.005

zbMATH Keywords

game theorytelecommunication

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Games involving graphs (91A43) Circuits, networks (94C99) Communication theory (94A05)

Related Items (58)

Constrained discounted stochastic games ⋮ A class of interference induced games: asymptotic Nash equilibria and parameterized cooperative solutions ⋮ Worst-case analysis of non-cooperative load balancing ⋮ Penalty-Regulated Dynamics and Robust Learning Procedures in Games ⋮ Generalized Nash equilibria for SaaS/PaaS clouds ⋮ Traffic routing oligopoly ⋮ A game-theoretic analysis of bandwidth allocation under a user-grouping constraint ⋮ Dynamics in tree formation games ⋮ Service Provisioning Problem in Cloud and Multi-Cloud Systems ⋮ Nondominated Nash points: application of biobjective mixed integer programming ⋮ On a generalized Cournot oligopolistic competition game ⋮ Bio-inspired paradigms in network engineering games ⋮ Cost sharing of cooperating queues in a Jackson network ⋮ Multi-resolution large population stochastic differential games and their application to demand response management in the smart grid ⋮ ``Cap and trade for congestion control ⋮ Customer equilibrium and optimal strategies in Markovian queues in series ⋮ Allocating costs in set covering problems ⋮ Three modeling paradigms in mathematical programming ⋮ Connectivity games over dynamic networks ⋮ A population game approach for dynamic resource allocation problems ⋮ Equilibrium behavior in tandem Markovian queues with heterogeneous delay-sensitive customers ⋮ An integrated planning model in centralized power systems ⋮ PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES ⋮ Transportation network with externalities ⋮ Broadcasting revenue sharing after cancelling sports competitions ⋮ A two‐stage network interdiction‐monitoring game ⋮ Cooperative networks games with elastic demands ⋮ Monotonicity properties of user equilibrium policies for parallel batch systems ⋮ Decentralized bandwidth control subject to two-layer constraints ⋮ Entry, competition, and regulation in cognitive radio scenarios: a simple game theory model ⋮ Modeling conflict processes on the Internet ⋮ Computing solutions of the multiclass network equilibrium problem with affine cost functions ⋮ Equilibrium customer strategies and social-profit maximization in the single-server constant retrial queue ⋮ The internet, evolutionary variational inequalities, and the time-dependent Braess paradox ⋮ Congestion control for a system with parallel stations and homogeneous customers using priority passes ⋮ Restrictive mechanism of flow control among non-cooperative internet users ⋮ Prices of anarchy, information, and cooperation in differential games ⋮ How much can taxes help selfish routing? ⋮ Network congestion analysis of gravity generated models ⋮ Buses of Cuernavaca—an agent-based model for universal random matrix behavior minimizing mutual information ⋮ A lexicographic approach to constrained MDP admission control ⋮ A Survey of Uniqueness Results for Selfish Routing ⋮ Service rate control of closed Jackson networks from game theoretic perspective ⋮ Controllable Markov jump processes. II: Monitoring and optimization of TCP connections ⋮ Selfish routing in public services ⋮ Stabilization of Decentralized Adaptive Control for Nonlinearly Parametrized Coupled Stochastic Multiagent Systems ⋮ Non-cooperative queueing games on a network of single server queues ⋮ Risk-Averse Selfish Routing ⋮ Multi-agent learning for engineers ⋮ Social media as author-audience games ⋮ Decomposition algorithms for generalized potential games ⋮ A Competitive Rate Allocation Game ⋮ Game-theoretic Robustness of Many-to-one Networks ⋮ Stochastic Loss Aversion for Random Medium Access ⋮ AN OVERVIEW ON GAME THEORY APPLICATIONS TO ENGINEERING ⋮ The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria ⋮ Core-stability over networks with widespread externalities ⋮ A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nested monotony for variational inequalities over product of spaces and convergence of iterative algorithms
• A game theoretic perspective to flow control in telecommunication networks
• Nonlinear programming and variational inequality problems. A unified approach
• Competitive pricing of information goods: Subscription pricing versus pay-per-use
• Practical bilevel optimization. Algorithms and applications
• Stochastic scheduling games with Markov decision arrival processes
• Correlated equilibrium and potential games
• Non zero-sum stochastic games in admission, service and routing control in queueing systems
• A differential game approach to the dynamic mixed behavior traffic network equilibrium problem
• Pricing strategies under heterogeneous service requirements.
• A Stackelberg network game with a large number of followers
• Avoiding paradoxes in multi-agent competitive routing.
• The Aumann-Shapley price mechanism for allocating congestion costs
• On the convergence to Nash equilibrium in problems of distributed computing
• Equilibrium, games, and pricing in transportation and telecommunication networks
• Incentive compatible pricing strategies for QoS routing
• Weak via strong Stackelberg problem: New results
• Potential games
• Congestion control as a stochastic control problem with action delays
• CDMA uplink power control as a noncooperative game
• Slotted Aloha as a game with partial information
• Multilevel flow control in telecommunication networks
• Uniqueness of the solution for optimal static routing in open BCMP queueing networks
• Zero-sum Markov games and worst-case optimal control of queueing systems
• \(S\)-modular games, with queueing applications
• Stochastic mathematical programs with equilibrium constraints
• Spanning network games.
• A class of games possessing pure-strategy Nash equilibria
• Braess-like paradoxes in distributed computer systems
• The Bargaining Problem
• Capacity Management in Decentralized Networks
• Dynamic Pricing for Network Service: Equilibrium and Stability
• Capacity allocation under noncooperative routing
• Rate control for communication networks: shadow prices, proportional fairness and stability
• How bad is selfish routing?
• Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
• On the relationship between Nash—Cournot and Wardrop equilibria
• Multiple Equilibrium Behaviors on Networks
• Equilibrium Points in Nonzero-Sum n-Person Submodular Games
• Minimum cost spanning tree games
• Optimal decentralized flow control of Markovian queueing networks with multiple controllers
• Network routing
• Cost allocation for steiner trees
• Avoiding the Braess paradox in non-cooperative networks
• Flow control using the theory of zero sum Markov games
• Braess's paradox in a queueing network with state-dependent routing
• Braess's paradox in a loss network
• A Game Theoretic Approach to Problems in Telecommunication
• On the existence of equilibria in noncooperative optimal flow control
• Common-Lines and Passenger Assignment in Congested Transit Networks
• On the relationship between dynamic Nash and instantaneous user equilibria
• Road congestion
• Constrained traffic equilibrium in routing
• S-modular games and power control in wireless networks
• Mixed equilibrium (ME) for multiclass routing games
• Nash equilibria for combined flow control and routing in networks: asymptotic behavior for a large number of users
• Competitive routing in networks with polynomial costs
• A Competitive Network Design Problem with Pricing
• Externalities, Average and Marginal Costs, and Tolls on Congested Networks with Time-Varying Flows
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
• Über ein Paradoxon aus der Verkehrsplanung
• The Regulation of Queue Size by Levying Tolls
• The network equilibrium problem in integers
• User Delay Costs and Internal Pricing for a Service Facility
• A paradox of congestion in a queuing network
• Potential games with continuous player sets
• Algorithmic mechanism design
• Sharing the cost of multicast transmissions
• Routing into two parallel links: Game-theoretic distributed algorithms

This page was built for publication: A survey on networking games in telecommunications