Revealing Preferences for Fairness in Ultimatum Bargaining

The ultimatum game has been the primary tool for studying bargaining behavior in recent years. However, not enough information is gathered in the ultimatum game to get a clear picture of respondersâ?? utility functions. We analyze a convex ultimatum game in which respondersâ?? can â??shrinkâ?� an offer as well as to accept or reject it. This allows us to observe enough about respondersâ?? preferences to estimate utility functions. We then successfully use data collected from convex ultimatum games to predict behavior in standard games. Our analysis reveals that rejections can be â??rationalizedâ?� with neo-classical preferences over own- and other-payoff that are convex, nonmonotonic, and regular. These findings present a precise benchmark for models of fairness and bargaining.

The bargaining set of a large economy with differential information

We study the Mas-Colell bargaining set of an exchange economy with differential information and a continuum of traders. We established the equivalence of the private bargaining set and the set of Radner competitive equilibrium allocations. As for the weak fine bargaining set, we show that it contains the set of competitive equilibrium allocations of an associated symmetric information economy in which each trader has the “joint information” of all the traders in the original economy, but unlike the weak fine core and the set of fine value allocations, it may also contain allocations which are not competitive in the associated economy.Publicad

On the Single-Valuedness of the Pre-Kernel

Based on results given in the recent book by Meinhardt (2013), which presents a dual characterization of the pre-kernel by a finite union of solution sets of a family of quadratic and convex objective functions, we could derive some results related to the uniqueness of the pre-kernel. Rather than extending the knowledge of game classes for which the pre-kernel consists of a single point, we apply a different approach. We select a game from an arbitrary game class with a single pre-kernel element satisfying the non-empty interior condition of a payoff equivalence class, and then establish that the set of related and linear independent games which are derived from this pre-kernel point of the default game replicates this point also as its sole pre-kernel element. In the proof we apply results and techniques employed in the above work. Namely, we prove in a first step that the linear mapping of a pre-kernel element into a specific vector subspace of balanced excesses is a singleton. Secondly, that there cannot exist a different and non-transversal vector subspace of balanced excesses in which a linear transformation of a pre-kernel element can be mapped. Furthermore, we establish that on the restricted subset on the game space that is constituted by the convex hull of the default and the set of related games, the pre-kernel correspondence is single-valued, and therefore continuous. Finally, we provide sufficient conditions that preserve the pre-nucleolus property for related games even when the default game has not a single pre-kernel point.Comment: 24 pages, 2 table

Coalitional Bargaining Equilibria

This paper takes up the foundational issue of existence of stationary subgame perfect equi- libria in a general class of coalitional bargaining games that includes many known bargaining models and models of coalition formation. General sufficient conditions for existence of equilib- ria are currently lacking in many interesting environments: bargaining models with non-concave stage utility functions, models with a Pareto optimal status quo alternative and heterogeneous discount factors, and models of coalition formation in public good economies with consumption lower bounds. This paper establishes existence of stationary equilibrium under compactness and continuity conditions, without the structure of convexity or comprehensiveness used in the extant literature. The proof requires a precise selection of voting equilibria following different proposals. The result is applied to obtain equilibria in models of bargaining over taxes, coalition formation in NTU environments, and collective dynamic programming problems.

Regularity of Pure Strategy Equilibrium Points in a Class of Bargaining Games

For a class of n-player (n ? 2) sequential bargaining games with probabilistic recognition and general agreement rules, we characterize pure strategy Stationary Subgame Perfect (PSSP) equilibria via a finite number of equalities and inequalities. We use this characterization and the degree theory of Shannon, 1994, to show that when utility over agreements has negative definite second (contingent) derivative, there is a finite number of PSSP equilibrium points for almost all discount factors. If in addition the space of agreements is one-dimensional, the theorem applies for all SSP equilibria. And for oligarchic voting rules (which include unanimity) with agreement spaces of arbitrary finite dimension, the number of SSP equilibria is odd and the equilibrium correspondence is lower-hemicontinuous for almost all discount factors. Finally, we provide a sufficient condition for uniqueness of SSP equilibrium in oligarchic games.Local Uniqueness of Equilibrium, Regularity, Sequential Bargaining.