Maximising a Function Over a Finite Set of Actions—Technical Note
这篇技术说明研究如何将有限行动集上的问题扩展为在双积集上最大化函数的问题，用不动点解和部分解刻画解集，并给出两种改进算法。
In this technical note we examine a method of extending a problem over a finite set of actions, to a problem of maximising a function over a bi-product set. The solution set is characterised in terms of fixed point solutions and partial solutions, and two improvement algorithms are given.