This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Learning To Be Leader

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Christopher Deissenberg (C.E.F.I., Universite d'Aix-Marseille II)
F. lvarez (U.C.M Madrid)

Additional information is available for the following registered author(s):

Abstract

Consider a dynamic game where, at each stage: (a) the player P1 physically acts first, without knowing all the elements of the problem faced by his opponent; (b) the player P2 physically acts second, with full knowledge of P1's problem. Thus, P1 cannot compute exactly the reaction function of P2, while P2 knows the reaction function of P1. Suppose that at each stage of the game P2 announces that it will implement a given action u^a after P1 has played (The announcement u^a is assumed to be an additional, rationally chosen action available to P2 besides its physical action u. In such a situation, P1 has two possibilities: (i) implement its best reaction to the announcement u^a, that is, act as if it was certain that P2 would really implement the announced action when it comes to play; or (ii) implement some other action based on all the information available to him.In this setting, the choice of decision by any one of the players will typically have a dual impact. It will affect not only the state of the underlying dynamic system, but also the information state of P2. These two aspects have to be taken into account by the players whenever they choose their current decisions, taking into account all future consequences of these decisions.In this paper, we investigate the dual problem facing the players in a simple game of the type presented above. We show that, typically, it will be rational for to P1 learn over time the private information of P2, thus discarding fully the announcements made by P2 and becoming a standard Stackelberg leader. In some cases, however, it may be rational for P1 not to make the effort of active learning. Furthermore, even in the case where it learns all the information available to P1, it may in its interest not to make use of this information, but to keep accepting prima facies the announcements made by P2.

Download Info
To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.

Publisher Info
Paper provided by Society for Computational Economics in its series Computing in Economics and Finance 2000 with number 208.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 05 Jul 2000
Date of revision:
Handle: RePEc:sce:scecf0:208

Contact details of provider:
Postal: CEF 2000, Departament d'Economia i Empresa, Universitat Pompeu Fabra, Ramon Trias Fargas, 25,27, 08005, Barcelona, Spain
Fax: +34 93 542 17 46
Email:
Web page: http://enginy.upf.es/SCE/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Christopher F. Baum).

Related research
Keywords:

Statistics
Access and download statistics

Did you know? RePEc and its associated services are free for contributors and users, and do not accept any advertising.

This page was last updated on 2009-12-9.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.