Pages that link to "Item:Q1104256"
From MaRDI portal
The following pages link to Relaxation techniques and asynchronous algorithms for on-line computation of non-cooperative equilibria (Q1104256):
Displayed 16 items.
- A Bayesian optimization approach to find Nash equilibria (Q116040) (← links)
- Distributed dynamic reinforcement of efficient outcomes in multiagent coordination and network formation (Q367468) (← links)
- Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions (Q839683) (← links)
- A dynamic Cournot-Nash game: a representation of a finitely repeated feedback game (Q926556) (← links)
- Numerical solutions to coupled-constraint (or generalised Nash) equilibrium problems (Q926559) (← links)
- Sequential decomposition and policy iteration schemes for \(M\)-player games with partial weak coupling (Q1190505) (← links)
- Distributed computation of Pareto solutions in \(n\)-player games (Q1352298) (← links)
- A Nash-game approach to joint image restoration and segmentation (Q1630744) (← links)
- Nash equilibrium seeking in quadratic noncooperative games under two delayed information-sharing schemes (Q2055354) (← links)
- Game theoretical security detection strategy for networked systems (Q2195399) (← links)
- On some approaches to find Nash equilibrium in concave games (Q2320285) (← links)
- Computation of Nash equilibria: Admissibility of parallel gradient descent (Q2564999) (← links)
- On generalized Nash games and variational inequalities (Q2643788) (← links)
- An Inverse-Adjusted Best Response Algorithm for Nash Equilibria (Q5114400) (← links)
- Dynamic advertising games in duopolies under one-step-ahead optimal control (Q6078092) (← links)
- Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games (Q6116265) (← links)
