A noncooperative game on polyhedral sets
type: Item
instance of: scholarly article
title: A noncooperative game on polyhedral sets
zbMATH Open document ID: 0914.90270
DOI: 10.1016/S0898-1221(97)00081-3
publication date: 1997-09-30T00:00:00Z
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91-08
zbMATH DE Number: 1068251
zbMATH Keywords: computation
zbMATH Keywords: Nash equilibrium point
zbMATH Keywords: polyhedral set of connected strategies
zbMATH Keywords: system of linear and quadratic constraints
author: A. S. Belen'kij
MaRDI profile type: Publication
cites work: A 2-person game on a polyhedral set of connected strategies
cites work: A planning problem in the class of linear models
cites work: Minimax planning problems with linear constraints and methods of their solution
cites work: Q3802887
published in: Computers & Mathematics with Applications
Recommended article: An antagonistic game on polyhedral sets
Recommended article: Q3325505
Recommended article: Noncooperative monomino games
Recommended article: Cooperative games on simplicial complexes
Recommended article: Cooperative games on antimatroids
Recommended article: Non-convexity in noncooperative game theory
Recommended article: Q3335558
Recommended article: Cooperative games with a simplicial core
Recommended article: Non-cooperative games on hyperfinite Loeb spaces
Recommended article: On separable non-cooperative zero-sum games
description: scientific article; zbMATH DE number 1068251