Computer Solution to the Game of Pure Strategy
We numerically solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behaviour in the results of our computations that seems to encourage odd or maximal bids.
Main Authors: | Laurent Bartholdi, Glenn C. Rhoads |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2012-11-01
|
Series: | Games |
Subjects: | |
Online Access: | http://www.mdpi.com/2073-4336/3/4/150 |
Similar Items
-
MIN-MAX SOLUTIONS FOR PARAMETRIC CONTINUOUS STATIC GAME UNDER ROUGHNESS (PARAMETERS IN THE COST FUNCTION AND FEASIBLE REGION IS A ROUGH SET)
by: Yousria A. Aboelnaga, et al.
Published: (2020-12-01) -
Linear programming model for solution of matrix game with payoffs trapezoidal intuitionistic fuzzy number
by: Darunee Hunwisai, et al.
Published: (2016-09-01) -
Linear programming approach to matrix games with intuitionistic fuzzy goals
by: Jiang-Xia Nan, et al.
Published: (2013-02-01) -
A New Decomposition Linear Programming Model to Solve Zero Sum Two Person Matrix Game in Fully Fuzzy Trapezoidal Environment
by: Kumar, G., et al.
Published: (2023) -
Computation of Nash equilibria in three-personmatrix game
by: Sigutė Vakarinienė, et al.
Published: (2009-12-01)