Nash triviality in families of Nash mappings
نویسندگان
چکیده
منابع مشابه
Beyond Nash Bargaining Theory: The Nash Set*
We extend Nash's bargaining theory to non-convex and coalitional problems. This paper investigates the implications of Nash-like axioms for bilateral problems and the properties of consistency and converse consistency over multilateral settings. The result is a characterization of the Nash set of NTU games, defined as the solution concept where each pair of players is splitting the gains from t...
متن کاملNash equilibrium
In game theory, Nash equilibrium (named after John Forbes Nash, who proposed it) is a solution concept of a game involving two or more players, in which each player is assumed to know the equilibrium strategies of the other players, and no player has anything to gain by changing only his own strategy unilaterally. If each player has chosen a strategy and no player can benefit by changing his or...
متن کاملHeterogeneity in Nash Networks*
Heterogeneity in Nash networks with two-way flow can arise due to differences in the following four variables: (i) the value of information held by agents, (ii) the rate at which information decays or loses its value as it traverses the network, (iii) the probability with which a link transmits information, and (iv) the cost of forming a link. In this paper we show that heterogeneity plays an i...
متن کاملRefinements of Nash Equilibrium
In game theory, “refinement” refers to the selection of a subset of equilibria, typically on the grounds that the selected equilibria are more plausible than other equilibria. These notes are a brief, largely informal, survey of some of the most heavily used refinements. Throughout, “equilibria” means Nash equilibria (NE), unless I state otherwise explicitly. And throughout, I assume that the g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’institut Fourier
سال: 2001
ISSN: 0373-0956
DOI: 10.5802/aif.1852