On minimax and Pareto optimal security payoffs in multicriteria games
From MaRDI portal
Publication:2408652
DOI10.1016/J.JMAA.2017.01.002zbMATH Open1415.91010OpenAlexW2571297035WikidataQ58217120 ScholiaQ58217120MaRDI QIDQ2408652FDOQ2408652
Publication date: 12 October 2017
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/141455
Recommendations
- Pareto-optimal security strategies as minimax strategies of a standard matrix game
- Solution concepts in continuous-kernel multicriteria games
- A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
- Solution concepts in two-person multicriteria games
- Solution concepts based on security levels in constrained multicriteria convex games
Cites Work
- Evaluating Information in Zero-Sum Games with Incomplete Information on Both Sides
- Some minimax theorems in vector-valued functions
- Solution concepts in two-person multicriteria games
- Multicriteria goal games
- Vector linear programming in zero-sum multicriteria matrix games
- Equilibrium selection and consistency
- Pareto-optimal security strategies in matrix games with fuzzy payoffs
- Core solutions in vector-valued games
- Title not available (Why is that?)
- A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
- Minimality of consistent solutions for strategic games, in particular for potential games
- Values for strategic games in which players cooperate
- Axiomatizations of Pareto equilibria in multicriteria games
- A neo\(^ 2\) Bayesian foundation of the maxmin value for two-person zero- sum games
- The consistency principle for games in strategic form
- An amalgation of games
- Pareto-optimal security strategies as minimax strategies of a standard matrix game
- The aggregate-monotonic core
- Remarks on the reasonable set of outcomes in a general coalition function form game
- Axiomatic Definition of the Value of a Matrix Game
- A characterization of the value of zero-sum two-person games
- Characterizations of the value of matrix games
Cited In (13)
- Decision making and games with vector outcomes
- Well-posedness and existence for the weak multicriteria Nash equilibrium of multicriteria games
- A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
- Title not available (Why is that?)
- A set optimization approach to zero-sum matrix games with multi-dimensional payoffs
- Solution concepts in two-person multicriteria games
- Owen-stable coalition partitions in games with vector payoffs
- Pareto-optimal security strategies as minimax strategies of a standard matrix game
- Cooperation Enforcing in Multistage Multicriteria Game: New Algorithm and Its Implementation
- On the characterization of saddle point equilibrium for security games with additive utility
- Title not available (Why is that?)
- Solution concepts in continuous-kernel multicriteria games
- Subgame Perfect Pareto Equilibria for Multicriteria Game with Chance Moves
This page was built for publication: On minimax and Pareto optimal security payoffs in multicriteria games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408652)
