A decomposition algorithm for finding equilibria in dynamic games
From MaRDI portal
Recommendations
- A game model of negotiations and market equilibria
- A Continuous Approach to Oligopolistic Market Equilibrium
- Search for maximum points of a vector criterion based on decomposition properties
- Analysis of competitive and cooperative solutions in dynamic auction games
- Adjustment processes for exchange economies and noncooperative games
Cited in
(12)- A heuristic procedure for seeking equilibria in coalitionless and antagonistic games
- Solving an equilibrium model for trade of \(\text{CO}_2\) emission permits
- A game model of negotiations and market equilibria
- Solution algorithms for regional interactions in large-scale integrated assessment models of climate change
- Analysis of competitive and cooperative solutions in dynamic auction games
- A two-level computable equilibrium model to assess the strategic allocation of emission allowances within the European Union
- An algorithm for finding Nash equilibria in dynamic network games
- Asymptotic behavior of solutions in dynamical bimatrix games with discounted indices
- Minimax generalized solutions of Hamilton-Jacobi equations in dynamic bimatrix games
- Analysis of equilibrium trajectories in dynamic bimatrix games
- Computing Equilibria of Dynamic Games
- Search for maximum points of a vector criterion based on decomposition properties
This page was built for publication: A decomposition algorithm for finding equilibria in dynamic games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2854262)
