Noemí Navarro

Fair allocation in networks with externalities

I prove existence and uniqueness of a component efficient and fair allocation rule when the value of the network is allowed to exhibit any type of externalities across its components. This is done by means of a new specification of the value function, generalizing partial results appearing in Myerson [Myerson, R.B., 1977a. Graphs and cooperation in games. Math. Operations Res. 2, 225-229], Feldman [Feldman, B.E., 1996. Bargaining, coalition formation and value. PhD dissertation. State University of New York at Stony Brook] and Jackson and Wolinsky [Jackson, M.O., Wolinsky, A., 1996. A strategic model of social and economic networks. J. Econ. Theory 71, 44-74]. This component efficient and fair allocation rule is found closely related to an extension of the Shapley value to TU-games in partition function form proposed by Myerson [Myerson, R.B., 1977b. Values of games in partition function form. Int. J. Game Theory 6 (1), 23-31]. (c) 2006 Elsevier Inc. All rights reserved.

Expected fair allocation in farsighted network formation

I consider situations in which a group of players extracts a value if they organise themselves in different network structures, and I define a solution concept to describe the decentralised decision that determines the network formation process and the allocation of the value. I demonstrate that there is a solution concept satisfying discounted expected versions of pairwise stability (Jackson and Wolinsky J Econ Theory 71:44–74, 1996) and fairness (Myerson Math Oper Res 2:225–229, 1977a) jointly with the requirement that the allocation rule be component efficient if the players’ discount factor is sufficiently low.

A simple bargaining procedure for the Myerson value

Abstract We consider situations where the cooperation and negotiation possibilities between pairs of agents are given by an undirected graph. Every connected component of agents has a value, which is the total surplus the agents can generate by working together. We present a simple, sequential, bilateral bargaining procedure, in which at every stage the two agents in a link, (i,j) bargain about their share from cooperation in the connected component they are part of. We show that this procedure yields the Myerson value (Myerson, 1997) if the marginal value of any link in a connected component is increasing in the number of links in that connected component.

Flexible network rules for identified externalities

I propose three modifications of Jacksons flexible network axiom (Jackson, 2005) when the structure of externalities across components have been identified. The first one takes into account the information about the externalities across components. The second one allows for coalitional deviations once the network has been formed. Finally, the third one tries to find a compromise with component efficiency (Myerson, 1977a).

Proficiency, Attitude, and Conventions in Minority Languages

In this article, we study a simple mathematical model of a bilingual community in which all agents are fluent in the majority language but only a fraction of the population has some degree of proficiency in the minority language. We investigate how different distributions of proficiency, combined with the speakers’ attitudes toward or against the minority language, may influence its use in pair conversations.