All Academic, Inc. Research Logo

Info/CitationFAQResearchAll Academic Inc.
Document

Generic Regularity of Stationary Equilibrium Points in a Class of Bargaining Games
Unformatted Document Text:  . Generic Regularity of Stationary Equilibrium Points in a Class of Bargaining Games 1 by Tasos Kalandrakis Preliminary Draft. Comments Welcomed. Abstract: For a class of n-player (n ≥ 2) sequential bargaining games with prob- abilistic recognition and general agreement rules, we characterize stationary subgame per-fect (SSP) equilibria as solutions to systems of equations and establish their existence viaBrouwer’s fixed point theorem. Using this characterization we show that when utility overagreements is strictly concave and satisfies certain smoothness conditions, there is a finitenumber of pure strategy SSP (PSSP) equilibrium points for almost all discount factors ordelay costs. When the space of agreements is one-dimensional, all equilibria are PSSP. Thesame is true for oligarchic voting rules (which include unanimity) for which, in addition, weshow that (generically) the number of equilibria is odd and equilibrium correspondence islower-hemicontinuous. Thus, for discounted unanimity games our results constitute a natu-ral analogue to the uniqueness finding of Merlo and Wilson, 1995, in cases when bargainingdoes not emulate the division of a cake, as is typical in political environments with ideologicalagreement spaces. Keywords: Local Uniqueness of Equilibrium, Regularity, Sequential Bargaining. Correspondence Address: Department of Political Science, Yale University, PO Box 208301, New Haven, CT 06520-8301. E-mail: ## email not listed ##. 1 Prepared for delivery at the annual meeting of the American Political Science Association, Philadelphia Mariott Hotel, Philadelphia, PA. 1

Authors: Kalandrakis, Anastassios.
first   previous   Page 1 of 21   next   last



background image
.
Generic Regularity of Stationary Equilibrium Points in
a Class of Bargaining Games
1
by
Tasos Kalandrakis
Preliminary Draft. Comments Welcomed.
Abstract:
For a class of n-player (n
≥ 2) sequential bargaining games with prob-
abilistic recognition and general agreement rules, we characterize stationary subgame per-
fect (SSP) equilibria as solutions to systems of equations and establish their existence via
Brouwer’s fixed point theorem. Using this characterization we show that when utility over
agreements is strictly concave and satisfies certain smoothness conditions, there is a finite
number of pure strategy SSP (PSSP) equilibrium points for almost all discount factors or
delay costs. When the space of agreements is one-dimensional, all equilibria are PSSP. The
same is true for oligarchic voting rules (which include unanimity) for which, in addition, we
show that (generically) the number of equilibria is odd and equilibrium correspondence is
lower-hemicontinuous. Thus, for discounted unanimity games our results constitute a natu-
ral analogue to the uniqueness finding of Merlo and Wilson, 1995, in cases when bargaining
does not emulate the division of a cake, as is typical in political environments with ideological
agreement spaces.
Keywords:
Local Uniqueness of Equilibrium, Regularity, Sequential Bargaining.
Correspondence Address:
Department of Political Science, Yale University, PO
Box 208301, New Haven, CT 06520-8301. E-mail: ## email not listed ##.
1
Prepared for delivery at the annual meeting of the American Political Science Association, Philadelphia
Mariott Hotel, Philadelphia, PA.
1


Convention
Need a solution for abstract management? All Academic can help! Contact us today to find out how our system can help your annual meeting.
Submission - Custom fields, multiple submission types, tracks, audio visual, multiple upload formats, automatic conversion to pdf.
Review - Peer Review, Bulk reviewer assignment, bulk emails, ranking, z-score statistics, and multiple worksheets!
Reports - Many standard and custom reports generated while you wait. Print programs with participant indexes, event grids, and more!
Scheduling - Flexible and convenient grid scheduling within rooms and buildings. Conflict checking and advanced filtering.
Communication - Bulk email tools to help your administrators send reminders and responses. Use form letters, a message center, and much more!
Management - Search tools, duplicate people management, editing tools, submission transfers, many tools to manage a variety of conference management headaches!
Click here for more information.

first   previous   Page 1 of 21   next   last

©2008 All Academic, Inc.