Related papers: A Finite Characterization of Perfect Equilibria
Ecosystems with a large number of species are often modelled as Lotka-Volterra dynamical systems built around a large random interaction matrix. Under some known conditions, a global equilibrium exists and is unique. In this article, we…
The completeness on the boundary (in the sense of Picone) of certain systems related to the III and IV BVPs for the elasticity system is proved. The completeness is obtained in both $L^p$ ($1\leq 1<\infty$) and uniform norms.
We establish sharp global regularity results for solutions to nonhomogeneous, nonunifomrly elliptic systems with zero boundary conditions. In particular, we obtain everywhere Lipschitz continuity under borderline Lorentz assumptions on the…
We propose a general definition of perfect equilibrium which is applicable to a wide class of games. A key feature is the concept of completely mixed nets of strategies, based on a more detailed notion of carrier of a strategy. Under…
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing optimal strategies and the values of competitive games…
In this paper, we study local systems of locally finite associative algebras over fields of characteristic p\ge0. We describe the perfect local systems and study the relation between them and their corresponding locally finite associative…
We discuss the characterization of relative equilibria of Lagrangian systems with symmetry.
This is a survey of results mostly relating elliptic equations and systems of arbitrary even order with rough coefficients in Lipschitz graph domains. Asymptotic properties of solutions at a point of a Lipschitz boundary are also discussed.
The concept of equilibrium is a general tool to fill the gap between macroscopic and mesoscopic information, both within kinetic systems and kinetic schemes. This work explores the use of equilibria to devise numerical boundary conditions…
An algebraically exact category in one that admits all of the limits and colimits which every variety of algebras possesses and every forgetful functor between varieties preserves, and which verifies the same interactions between these…
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
Exact Solov'ev equilibria for arbitrary plasma cross-sections are calculated using a constrained least-squares method. The boundary, with or without $X$-points, can be specified with an arbitrarily large number of constraints to ensure an…
The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a…
The $\lambda$-perfect maps, a generalization of perfect maps (continuous closed maps with compact fibers) are presented. Using $P_\lambda$-spaces and the concept of $\lambda$-compactness some results regarding $\lambda$-perfect maps will be…
We introduce the notion of accurate foundation sets and the accurate refinement property for right LCM semigroups. For right LCM semigroups with this property, we derive a more explicit presentation of the boundary quotient. In the context…
This paper proposes a new equilibrium concept "robust perfect equilibrium" for non-cooperative games with a continuum of players, incorporating three types of perturbations. Such an equilibrium is shown to exist (in symmetric mixed…
Peak estimation of hybrid systems aims to upper bound extreme values of a state function along trajectories, where this state function could be different in each subsystem. This finite-dimensional but nonconvex problem may be lifted into an…
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytically tractable than the standard definition in terms of…
We define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of probability values obtained when the equation varies. We…
Many kinds of categorical structure require the existence of finite limits, of colimits of some specified type, and of "exactness" conditions between the finite limits and the specified colimits. Some examples are the notions of regular, or…