This book offers an extensive and original study of the dynamics of rivalry, evolution of costly and violent conflicts, and potential cooperation among powerful players. It unravels the special features of the global socio-economic system that can make it extremely fragile and vulnerable. It...

In a context of laissez-faire, the propositions established in this paper shed light on the evolution of the problem of greenhouse gas (GHG) accumulation in the atmosphere for each type of strategic behaviour resulting from countries’ interconnection on global markets. In a framework of strong...

We show that if limit orders are required to vary smoothly, then strategic (Nash) equilibria of the double auction mechanism yield competitive (Walras) allocations. It is not necessary to have competitors on any side of any market: smooth trading is a substitute for price wars. Inparticular,...

We show that if limit orders are required to vary smoothly, then strategic (Nash) equilibria of the double auction mechanism yield competitive (Walras) allocations. It is not necessary to have competitors on any side of any market: smooth trading is a substitute for price wars. In particular,...

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...

This paper yields sufficient conditions for Pareto inoptimality of controls forming Nash equilibria in differential games. In Appendix a result on existence of open loop Nash equilibria is added.

This paper examines the problem of nonexistence of equilibrium in a simple search model with asymmetric information. A pure-strategy, symmetric Nash equilibrium fails to exist because adverse selection arising from steady-state considerations causes a nonconcavity in the payoff function.

This paper provides a simple formula describing all Nash equilibria in monotone symmetric singleton congestion games. Our approach also yields a new and short proof establishing the existence of a Nash equilibrium in this kind of congestion games.

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...