A 2-person game on a polyhedral set of connected strategies

DOI10.1016/S0898-1221(97)00037-0zbMath0871.90109MaRDI QIDQ1356874

A. S. Belen'kij

Publication date: 5 October 1997

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

zbMATH Keywords

saddle pointsquadratic constraints2-person zero-sum gamemin-max and max-min pointssum of two linear functionsunbounded polyhedral set

Mathematics Subject Classification ID

Quadratic programming (90C20) 2-person games (91A05)

Related Items (9)

A modified ``winner-take-all rule for awarding state electoral votes in US presidential elections and a game model for its analysis ⋮ Two Classes of Games on Polyhedral Sets in Systems Economic Studies ⋮ A noncooperative game on polyhedral sets ⋮ Cooperative games of choosing partners and forming coalitions in the marketplace. ⋮ Finding the exact lower estimate of the maximin of a minimum function on a polyhedron of connected variables ⋮ Two rules of a sealed ceiling bid and their analysis by mathematical programming techniques ⋮ Competitive strategies of U.S. presidential candidates in election campaigns ⋮ On randomized fictitious play for approximating saddle points over convex sets ⋮ A mathematical model for estimating the potential margin of state undecided voters for a candidate in a US federal election

Cites Work

• Min-max problems with monotone functions on polyhedral sets
• Minimax planning problems with linear constraints and methods of their solution
• A 3-person game on polyhedral sets
• A linear max—min problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A 2-person game on a polyhedral set of connected strategies