Hedging and Maxmin
Copyright policy )Hedging and Maxmin
A continuous game is discussed in which two opposing players move in turn, and an algorithm is developed which finds an optimal strategy for the player moving first. The algorithm is characterized by a fictitious sequence of alternating plays in which the first player selects his strategies by hedging against all his opponent's strategies played up until that time.
maxmin, military planning, Applications of mathematical programming, algorithm, continuous game, calculation of optimal strategy, fictitious sequence of alternating plays, Existence of solutions for minimax problems, hedging, 2-person games
maxmin, military planning, Applications of mathematical programming, algorithm, continuous game, calculation of optimal strategy, fictitious sequence of alternating plays, Existence of solutions for minimax problems, hedging, 2-person games
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!