John M. Danskin

  • Citations Per Year
Learn More
This is an announcement of results to be proved in detail in a later report in book form. The author introduces a new value, the H-value, into differential games, and proves that six well-known values for games of perfect information now in the literature are special cases of it. He proves that two (in the present slightly altered formulation four) values(More)
Lemma (Lemke ' s Closest-Point Principle). Denote by B the set of non-negative linear combinations b = ~,~=1 I~jbj, I~j >O, of the bj. Then there are two possibilities : Either a E B, in which case the maximum in (1) is non-positive, or else a ~: B. In the latter case, denote by b (a) the point of B lying closest to a. Put )t (a) = [a b (a)[ and then 2/(a)(More)
  • 1