743 research outputs found

    Decomposition of (co)isotropic relations

    Full text link
    We identify thirteen isomorphism classes of indecomposable coisotropic relations between Poisson vector spaces and show that every coisotropic relation between finite-dimensional Poisson vector spaces may be decomposed as a direct sum of multiples of these indecomposables. We also find a list of thirteen invariants, each of which is the dimension of a space constructed from the relation, such that the 13-vector of multiplicities and the 13-vector of invariants are related by an invertible matrix over Z\mathbb Z. It turns out to be simpler to do the analysis above for isotropic relations between presymplectic vector spaces. The coisotropic/Poisson case then follows by a simple duality argument.Comment: 9 pages. The final publication is available at Springer via http://dx.doi.org/10.1007/s11005-016-0863-5, in a special issue of Letters in Mathematical Physics dedicated to the memory of Louis Boutet de Monvel. A free, view-only version of the final publication is available under the following link http://rdcu.be/mFX

    (Co)isotropic Pairs in Poisson and Presymplectic Vector Spaces

    Full text link
    We give two equivalent sets of invariants which classify pairs of coisotropic subspaces of finite-dimensional Poisson vector spaces. For this it is convenient to dualize; we work with pairs of isotropic subspaces of presymplectic vector spaces. We identify ten elementary types which are the building blocks of such pairs, and we write down a matrix, invertible over Z\mathbb{Z}, which takes one 10-tuple of invariants to the other

    Robust Predictions in Infinite-Horizon Games--an Unrefinable Folk Theorem

    Get PDF
    We show that in any game that is continuous at infinity, if a plan of action ai is played by a type ti in a Bayesian Nash equilibrium, then there are perturbations of ti for which ai is the only rationalizable plan and whose unique rationalizable belief regarding the play of the game is arbitrarily close to the equilibrium belief of ti. As an application to repeated games, we prove an unrefinable folk theorem: any individually rational and feasible payoff is the unique rationalizable payoff vector for some perturbed type profile. This is true even if perturbed types are restricted to believe that the repeated-game payoff structure and the discount factor are common knowledge.Institute for Advanced Study (Princeton, N.J.

    Sensitivity of equilibrium behavior to higher-order beliefs in nice games

    Get PDF
    We analyze “nice” games (where action spaces are compact intervals, utilities continuous and strictly concave in own action), which are used frequently in classical economic models. Without making any “richness” assumption, we characterize the sensitivity of any given Bayesian Nash equilibrium to higher-order beliefs. That is, for each type, we characterize the set of actions that can be played in equilibrium by some type whose lower-order beliefs are all as in the original type. We show that this set is given by a local version of interim correlated rationalizability. This allows us to characterize the robust predictions of a given model under arbitrary common knowledge restrictions. We apply our framework to a Cournot game with many players. There we show that we can never robustly rule out any production level below the monopoly production of each firm
    corecore