Abstract. We study farsighted coalitional stability in the context of TUgames. Chwe (1994, p.318) notes that, in this context, it is difficult to prove nonemptiness of the largest ...
This article presents a method for valuing software, based on the income that use of that software is expected to generate in the future. It applies well known principles of intel...
Learning algorithms often obtain relatively low average payoffs in repeated general-sum games between other learning agents due to a focus on myopic best-response and one-shot Nas...
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...