Cooperative games in strategic form

In this paper we view bargaining and cooperation as an interaction superimposed on a strategic form game. A multistage bargaining procedure for N players, the proposer commitment procedure, is presented. It is inspired by Nash s two-player variable-threat model; a key feature is the commitment to threats. We establish links to classical cooperative game theory solutions, such as the Shapley value in the transferable utility case. However, we show that even in standard pure exchange economies the traditional coalitional function may not be adequate when utilities are not transferable.

Bargaining, coalitions and competition

We study a decentralized matching model in a large exchange economy,in which trade takes place through non--cooperative bargaining in coalitionsof finite size. Under essentially the same conditions of core equivalence, we show that the strategic equilibrium outcomes of our model coincide with theWalrasian allocations of the economy. Our method of proof exploits equivalenceresults between the core and Walrasian equilibria. Our model relaxes differentiability and convexity of preferences thereby covering the caseof indivisible goods.

Equity considerations in health care: An axiomatic bargaining approach

The general issues of equity and efficiency are placed at the center of the analysis of resource allocation problems in health care. We examine them using axiomatic bargaining theory. We study different solutions that have been proposed and relate them to previous literature on health care allocation. In particular, we focus on the solutions based on axiomatic bargaining with claims and suggest that they may be particularly appealing as distributive criteria in health policy. Finally, we present the results of a survey that tries to elicit moral intuitions of people about resource allocation problems and their different solutions.

An experiment on Nash implementation

We perform an experimental test of Maskin's canonical mechanism for Nashimplementation, using 3 subjects in non-repeated groups, as well as 3 outcomes, states of nature, and integer choices. We find that this mechanism succesfully implements the desired outcome a large majority of the time and an imbedded comprehension test indicates that subjects were generally able to comprehend their decision tasks. The performance can also be improved by imposing a fine on non designated dissidents. We offer some explanations for the imperfect implementation, including risk preferences, the possibilities that agents have for collusion, and the mixed strategy equilibria of the game.

Global Nash convergence of Foster and Young's regret testing

We construct an uncoupled randomized strategy of repeated play such that, if every player follows such a strategy, then the joint mixed strategy profiles converge, almost surely, to a Nash equilibrium of the one-shot game. The procedure requires very little in terms of players' information about the game. In fact, players' actions are based only on their own past payoffs and, in a variant of the strategy, players need not even know that their payoffs are determined through other players' actions. The procedure works for general finite games and is based on appropriate modifications of a simple stochastic learningrule introduced by Foster and Young.

SPOC Collective Bargaining Agreement 2007-2009, July 2007

This Agreement made and entered into this 1st day of July 2007 at Des Moines, Iowa, pursuant to the provisions of Chapter 20 of the Iowa Code, by and between the State of Iowa (hereinafter referred to as the Employer) and the State Police Officers Council, and its appropriate affiliated sub-organizations (hereinafter referred to as the Council), as representatives of employees employed by the State of Iowa, as set forth specifically in the Recognition Clause.

AFSCME Collective Bargaining Agreement 2007-2009, July 2007

This Agreement made and entered into this 1st day of July 2007, at Des Moines, Iowa, pursuant to the provisions of Chapter 20 of the Code of Iowa, by and between the State of Iowa (hereinafter referred to as the Employer) and the American Federation of State, County, and Municipal Employees, Iowa Public Employees Council 61, AFL-CIO (hereinafter referred to as the Union), and its appropriate affiliated locals, as representatives of employees employed by the State of Iowa, as set forth specifically in Appendix A.

IUP Social Services Collective Bargaining Agreement, July 2007

This agreement made and entered in to this 1st day of July 2007, at Des Moines, Iowa pursuant to the provisions of Chapter 20 of the Iowa code, by and between the State of Iowa (hereinafter referred to as the Employer) and UE Local 893/Iowa United Professionals, and it's appropriate affiliated locals, as representatives of employees employed by the State of Iowa, as set forth specifically in appendix A (hereinafter referred to as the Union).

A comment on the Nash program and the theory of implementation

The mechanisms in the Nash program for cooperative games are madecompatible with the framework of the theory of implementation. This is donethrough a reinterpretation of the characteristic function that avoids feasibilityproblems, thereby allowing an analysis that focuses exclusively on the payoff space. In this framework, we show that the core is the only majorcooperative solution that is Maskin monotonic. Thus, implementation of mostcooperative solutions must rely on refinements of the Nash equilibrium concept(like most papers in the Nash program do). Finally, the mechanisms in theNash program are adapted into the model.

Invariance and randomness in the Nash program for coalitional games

By introducing physical outcomes in coalitional games we note that coalitional games and social choice problems are equivalent (implying that so are the theory of implementation and the Nash program). This facilitates the understanding of the role of invariance and randomness in the Nash program. Also, the extent to which mechanisms in the Nash program perform ``real implementation'' is examined.

Stochastic uncoupled dynamics and Nash equilibrium

In this paper we consider dynamic processes, in repeated games, that are subject to the natural informational restriction of uncoupledness. We study the almost sure convergence to Nash equilibria, and present a number of possibility and impossibility results. Basically, we show that if in addition to random moves some recall is introduced, then successful search procedures that are uncoupled can be devised. In particular, to get almost sure convergence to pure Nash equilibria when these exist, it su±ces to recall the last two periods of play.

Finite horizon bargaining and the consistent field

This paper explores the relationships between noncooperative bargaining games and the consistent value for non-transferable utility (NTU) cooperative games. A dynamic approach to the consistent value for NTU games is introduced: the consistent vector field. The main contribution of the paper is to show that the consistent field is intimately related to the concept of subgame perfection for finite horizon noncooperative bargaining games, as the horizon goes to infinity and the cost of delay goes to zero. The solutions of the dynamic system associated to the consistent field characterize the subgame perfect equilibrium payoffs of the noncooperative bargaining games. We show that for transferable utility, hyperplane and pure bargaining games, the dynamics of the consistent fields converge globally to the unique consistent value. However, in the general NTU case, the dynamics of the consistent field can be complex. An example is constructed where the consistent field has cyclic solutions; moreover, the finite horizon subgame perfect equilibria do not approach the consistent value.