A noncooperative game on polyhedral sets

DOI10.1016/S0898-1221(97)00081-3zbMath0914.90270MaRDI QIDQ1368829

A. S. Belen'kij

Publication date: 30 September 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

computationNash equilibrium pointpolyhedral set of connected strategiessystem of linear and quadratic constraints

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Computational methods for problems pertaining to game theory, economics, and finance (91-08)

Related Items (2)

Two rules of a sealed ceiling bid and their analysis by mathematical programming techniques ⋮ Competitive strategies of U.S. presidential candidates in election campaigns

Cites Work

• A planning problem in the class of linear models
• Minimax planning problems with linear constraints and methods of their solution
• A 2-person game on a polyhedral set of connected strategies
• Unnamed Item

This page was built for publication: A noncooperative game on polyhedral sets