Nondominated Nash points: application of biobjective mixed integer programming
type: Item
instance of: scholarly article
title: Nondominated Nash points: application of biobjective mixed integer programming
zbMATH Open document ID: 1393.90106
author: Hadi Charkhgard
author: Masoud Talebian
author: Martin W. P. Savelsbergh
published in: 4OR
publication date: 2018-08-03T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91-08
zbMATH DE Number: 6913708
zbMATH Keywords: biobjective mixed integer linear programming
zbMATH Keywords: normal form game
zbMATH Keywords: efficient Nash equilibria
zbMATH Keywords: disagreement point
MaRDI profile type: Publication
full work available at URL: s10288-017-0354-2
OpenAlex ID: W2755317046
cites work: A survey on networking games in telecommunications
cites work: Enumeration of all extreme equilibria of bimatrix games
cites work: Enumeration of Nash equilibria for two-player games
cites work: A criterion space search algorithm for biobjective integer programming: the balanced box method
cites work: An algorithm for the bi-criterion integer programming problem
cites work: Q3760254
cites work: Nash solution and uncertain disagreement points
cites work: Benchmarking optimization software with performance profiles.
cites work: A discussion of scalarization techniques for multiple objective integer programming
cites work: On the Strategic Stability of Equilibria
cites work: Vector linear programming in zero-sum multicriteria matrix games
cites work: A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
cites work: Q3997197
cites work: Maximal nash subsets for bimatrix games
cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
cites work: Planning Algorithms
cites work: Equilibrium Points of Bimatrix Games
cites work: Finding all nondominated points of multi-objective integer programs
cites work: Q4369429
cites work: Equilibrium Points in Finite Games
cites work: Refinements of the Nash equilibrium concept
cites work: The Bargaining Problem
cites work: Non-cooperative games
cites work: Two-Person Cooperative Games
cites work: Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game and corresponding mathematical programming problem
cites work: Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game in extensive form and corresponding mathematical programming problem
cites work: Pareto optimality, game theory and equilibria
cites work: Simple search methods for finding a Nash equilibrium
cites work: An improved algorithm for solving biobjective integer programs
cites work: The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
cites work: Reexamination of the perfectness concept for equilibrium points in extensive games
cites work: Multiagent Systems
cites work: Ideal equilibria in noncooperative multicriteria games.
cites work: Games with multiple payoffs
DOI: 10.1007/S10288-017-0354-2
description: scientific article; zbMATH DE number 6913708