In John Nash’s proofs for the existence of (Nash) equilibria based on Brouwer’s theorem, an iteration mapping is used. A continuous— time analogue of the same mapping has been studied even earlier by Brown and von Neumann. This differential equation has recently been suggested as a...

consider an N-player normal form game played repeatedly in which each player should choose each strategy exactly one time (payoffs are aggregated). such "play only once" situations occur naturally in the context of scheduling. assume that each player has the same number of strategies. Then,...

We run an experiment that implements a finitely repeated version of the trust game in which players can choose in each period with whom to interact. Change in trust and trustworthiness in terms of previous experience is statistically investigated where confounding factors are controlled for....