Nondominated Nash points: application of biobjective mixed integer programming

DOI10.1007/s10288-017-0354-2zbMath1393.90106OpenAlexW2755317046MaRDI QIDQ1653352

Masoud Talebian, Hadi Charkhgard, Savelsbergh, Martin W. P.

Publication date: 3 August 2018

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-017-0354-2

zbMATH Keywords

normal form gamedisagreement pointbiobjective mixed integer linear programmingefficient Nash equilibria

Mathematics Subject Classification ID

Mixed integer programming (90C11) Multi-objective and goal programming (90C29) 2-person games (91A05) Computational methods for problems pertaining to game theory, economics, and finance (91-08)

Related Items (2)

THE MAGIC OF NASH SOCIAL WELFARE IN OPTIMIZATION: DO NOT SUM, JUST MULTIPLY! ⋮ Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding all nondominated points of multi-objective integer programs
• Enumeration of Nash equilibria for two-player games
• A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
• Pareto optimality, game theory and equilibria
• Simple search methods for finding a Nash equilibrium
• Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game in extensive form and corresponding mathematical programming problem
• An algorithm for the bi-criterion integer programming problem
• Nash solution and uncertain disagreement points
• Reexamination of the perfectness concept for equilibrium points in extensive games
• Games with multiple payoffs
• Ideal equilibria in noncooperative multicriteria games.
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• An improved algorithm for solving biobjective integer programs
• A discussion of scalarization techniques for multiple objective integer programming
• Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game and corresponding mathematical programming problem
• Vector linear programming in zero-sum multicriteria matrix games
• A survey on networking games in telecommunications
• Non-cooperative games
• Enumeration of All Extreme Equilibria of Bimatrix Games
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
• The Bargaining Problem
• The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
• Equilibrium Points in Finite Games
• Multiagent Systems
• Maximal nash subsets for bimatrix games
• On the Strategic Stability of Equilibria
• Equilibrium Points of Bimatrix Games
• Equilibrium Points of Bimatrix Games
• Planning Algorithms
• Two-Person Cooperative Games
• Refinements of the Nash equilibrium concept
• Benchmarking optimization software with performance profiles.

This page was built for publication: Nondominated Nash points: application of biobjective mixed integer programming