1,721,078 research outputs found
Subgame-Perfection in Quitting Games with Perfect Information and Differential Equations
Going Beyond Counting First Authors in Author Co-citation Analysis
The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Quitting Games
Quitting games are sequential games in which, at any stage, each player has the choice between continuing and quitting. The game ends as soon as at least player chooses to quit; player i then receives a payoff r, which depends on the set S of players that did choose to quit. If the game never ends, the payoff to each player is 0. We prove the existence of cyclic E-equilibrium under some assumptions on the payoff function (r sub s). We prove on an example that our result is essentially optimal. We also discuss the relation to Dynkin's stopping games, and provide a generalization of our result to these games
Correlated Equilibrium in Stochastic Games
We study the existence of uniform correlated equilibrium payoffs in stochastic games. The correlation devices that we use are either autonomous (they base their choice of signal on previous signals, but not on previous states or actions) or stationary (their choice is independent of any data and is drawn according to the same probability distribution at every stage). We prove that any n-player stochastic game admits an autonomous correlated equilibrium payoff. When the game is positive and recursive, a stationary correlated equilibrium payoff exists. Journal of Economic Literature Classification Numbers: C72, C73
Stopping Games: recent results
Cahier de Recherche du Groupe HEC Paris, n° 744We survey recent results on the existence of the value in zerosum stopping games with discrete and continuous time, and on the existence of e-equilibria in non zero-sum games with discrete time
- …
