We characterize convex vNM-Stable Sets according to von Neumann and Morgenstern for orthogonal linear production games with a continuum of players. The results of [Rosenmüller & Shitovitz, International Journal of Game Theory 29 (2000)] are thereby substantially improved. Simultaneously, this...

In this paper we demonstrate a new method for computing approximate Nash equilibria in n-person games. Strategy spaces are assumed to be represented by simplices, while payoff functions are assumed to be concave. Our procedure relies on a simplicial algorithm that traces paths through the set of...

We investigate an extension of Dekel, Ely and Yilankaya's (2004) treatment of the evolution of preference to more general, possibly nonexpected utility preferences. Along the lines of their analysis we consider a population of types that is repeatedly and randomly matched to play the mixed...

We study network formation in a strategic setting where every agent strives for short paths to the other agents. The main parameter of our model is the marginal rate of substitution between network benefits and linking costs. We provide boundaries of stable networks for increasing and decreasing...

Top responsiveness is introduced by Alcalde and Revilla [Journal of Mathematical Economics 40 (2004) 869-887] as a property which induces a rich domain on playerss preferences in hedonic games, and guarantees the existence of core stable partitions. We strengthen this observation by proving the...

We prove that a preference relation which is continuous on every straight line has a utility representation if its domain is a convex subset of a finite dimensional vector space. Our condition on the domain of a preference relation is stronger than Eilenberg (1941) and Debreu (1959, 1964), but...