Unified approach to approximate solutions in games and multiobjective programming
From MaRDI portal
Using a theorem of the second author [SIAM Rev. 23, 225-237 (1981; Zbl 0456.90091)], we derive results about approximate solutions for Nash equilibrium theory and for multiobjective problems. We describe conditions under which one can replace an infinite strategy set, an infinite alternative set, or an infinite set of criteria by a finite subset without loosing all approximate solutions of the problem under consideration.
Recommendations
- Approximations and well-posedness in multicriteria games
- A game theoretic approach for solving multiobjective linear programming problems
- A game theoretical approach for finding near-optimal solutions of an optimization problem
- On approximate solutions in multiobjective optimization
- Approximate solutions of multiobjective optimization problems
- Approximation methods in multiobjective programming
- scientific article; zbMATH DE number 1830716
- An optimization approach for approximate Nash equilibria
- Approximation in multiobjective optimization
Cites work
Cited in
(2)
This page was built for publication: Unified approach to approximate solutions in games and multiobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072943)