SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

A Stackelberg Network Game with a Large Number of Followers · Study

ArticleShelves

ArticleA Stackelberg Network Game with a Large Number of Followers

Tamer Başar2002

Article2002

A Stackelberg Network Game with a Large Number of Followers

Tamer Başar · R. Srikant

135 citations·0/0 files stored·Journal of Optimization Theory and Applications

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Game Theory and Applications Transportation Planning and Optimization Network Traffic and Congestion Control

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 135 citations exist upstream.

References

1982Dynamic Noncooperative Game Theory 1993Competitive routing in multiuser communication networks 1995Large deviations, the shape of the loss curve, and economies of scale in large multiplexers 1995Architecting noncooperative networks 2002Competitive routing in networks with polynomial costs 1978Leader-follower strategies for multilevel systems

Cited by

2011Network Games: Theory, Models, and Dynamics 2019Stochastic Stackelberg differential reinsurance games under time-inconsistent mean–variance framework 2007Optimal Nonlinear Pricing for a Monopolistic Network Service Provider with Complete and Incomplete Information 2007Incentives and Pricing in Communications Networks 2014Hierarchical Mean Field Games for Multiagent Systems With Tracking-Type Costs: Distributed $\varepsilon $-Stackelberg Equilibria 2004Differentiated Internet pricing using a hierarchical network game model 2004Selfish Routing on the Internet.2020

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2002Competitive routing in networks with polynomial costsarticle · 3 shared references 2007Distributed Algorithms for Nash Equilibria of Flow Control Gameschapter · 3 shared references 2002Mixed equilibrium (ME) for multiclass routing gamesarticle · 3 shared references 2001Routing into Two Parallel Links: Game-Theoretic Distributed Algorithmsarticle · 3 shared references 2004Differentiated Internet pricing using a hierarchical network game modelother · 3 shared references 2007Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Usersarticle · 3 shared references

Details

Year2002

Typearticle

Published2002-12-01

VenueJournal of Optimization Theory and Applications

ISSN-L0022-3239

Languageen

Citations135

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1023/a:1021294828483

openalex_workW1519289091

Links

Imported from OpenAlex (CC0) — nothing here is generated.

Linear-Quadratic Time-Inconsistent Mean-Field Type Stackelberg Differential Games: Time-Consistent Open-Loop Solutions