1. RAND Bookstore
  2. Note on the Solution of Convex Games
Note on the Solution of Convex Games
shop.rand.org

Note on the Solution of Convex Games

$20.00
{{option.name}}: {{selected_options[option.position]}}
{{value_obj.value}}
Store Logo

RAND Bookstore

View Store

A method of selecting a finite subset from an arbitrary set of linear functions for convex regions of arbitrary finite dimension.

Show More Show Less

Related Collections

  • Miniature Gaming Game
  • Gaming Dice Game
  • Gaming Table For Game
  • Gaming Accessory
  • Rpg Gaming Video Game
  • Game Playmat, Gaming Playmat, Playmat For Gaming
  • Game Mat Gaming
  • Video Game Gaming
  • Gaming Earphone Game
  • Gaming Console Game
  • Gaming Chair Game
  • Gaming Mouse Game
  • Thank You Note Card
  • Card Envelope Note
  • Card Pack Note
  • Floral Note Card

More products by RAND Bookstore

A Characterization of Local Solutions Useful for Solving Reverse Convex Problems. - RAND Bookstore
shop.rand.org
$20.00

A Characterization of Local Solutions Useful for Solving Reverse Convex Problems.

RAND Bookstore RAND Bookstore
A Class of Games with Unique Solutions - RAND Bookstore
shop.rand.org
$20.00

A Class of Games with Unique Solutions

RAND Bookstore RAND Bookstore
A Class of Games with Unique Density Function Solutions - RAND Bookstore
shop.rand.org
$20.00

A Class of Games with Unique Density Function Solutions

RAND Bookstore RAND Bookstore
A Cutting Plane Algorithm for Problems Containing Convex and Reverse Convex Constraints. - RAND Bookstore
shop.rand.org
$20.00

A Cutting Plane Algorithm for Problems Containing Convex and Reverse Convex Constraints.

RAND Bookstore RAND Bookstore
View All