Network games; adaptations to Nash-Cournot equilibrium
From MaRDI portal
Publication:1918427
DOI10.1007/BF02187645zbMath0854.90152OpenAlexW2087905245MaRDI QIDQ1918427
Charles D. Horvath, Sjur Didrik Flåm
Publication date: 19 January 1997
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02187645
stochastic approximationNash equilibriasubgradientnonlinear flowsubgradient projectionnoncooperative agentsstochastic and nonsmooth data
Nonsmooth analysis (49J52) Games involving graphs (91A43) Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05)
Related Items
Stability, efficiency, and contentedness of social storage networks ⋮ REPEATED PLAY AND NEWTON'S METHOD ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Convergence of least squares learning mechanisms in self-referential linear stochastic models
- Stochastic approximation methods for constrained and unconstrained systems
- Learning mixed equilibria
- Handbook of game theory with economic applications. Vol. 1
- Network economics: a variational inequality approach
- Non-cooperative games
- On the relationship between Nash—Cournot and Wardrop equilibria
- Alternative Models of Spatial Competition
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- A Theory of Dynamic Oligopoly, II: Price Competition, Kinked Demand Curves, and Edgeworth Cycles
- A mathematical programming approach for determining oligopolistic market equilibrium
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Convex Analysis
