Onn-person game solutions and convex programs with essentially unconstrained duals1

DOI10.1080/02331938808843319zbMath0646.90101OpenAlexW1970394048MaRDI QIDQ3790979

A. Charnes, Boaz Golany, Aharon Ben-Tal

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938808843319

zbMATH Keywords

entropic solutionsCharles-Kortanek convex nucleus solutionsunconstrained duals

Mathematics Subject Classification ID

Convex programming (90C25) Noncooperative games (91A10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the formation of unions in \(n\)-person games
• Complements, mollifiers and the propensity to disrupt
• A production problem and computation of the N-core using coverings
• The Nucleolus of a Characteristic Function Game

This page was built for publication: Onn-person game solutions and convex programs with essentially unconstrained duals¹