Phenomena in Inverse Stackelberg Games,Part 1: Static Problems

Games are considered in which the role of the players is a hierarchical one. Some players behave as leaders, others as followers. Such games are named after Stackelberg. In the current paper, a special type of these games is considered, known in the literature as inverse Stackelberg games. In such games, the leader (or: leaders) announces his strategy as a mapping from the follower (or: followers) decision space into his own decision space. Arguments for studying such problems are given. The routine way of analysis, leading to a study of composed functions, is not very fruitful. Other approaches are given, mainly by studying specific examples. Phenomena in problems with more than one leader and/or follower are studied within the context of the inverse Stackelberg concept. As a side issue, expressions like “two captains on a ship” and “divide and conquer” are given a mathematical foundation.     

On the Approximate Controllability of Stackelberg–Nash Strategies for Linearized Micropolar Fluids

We study a Stackelberg strategy subject to the evolutionary linearized micropolar fluids equations, considering a Nash multi-objective equilibrium (non necessarily cooperative) for the “follower players” (as is called in the economy field) and an optimal problem for the leader player with approximate controllability objective. We will obtain the following three main results: the existence and uniqueness of Nash equilibrium and its characterization, the approximate controllability of the linearized micropolar system with respect to the leader control, and the existence and uniqueness of the Stackelberg–Nash problem, where the optimality system for the leader is given.     

Hierarchic control

Distributed control is applied to a system modelled by a parabolic evolution equation. One considers situations where there are two cost (objective) functions. One possible way is to cut the control into 2 parts, one being thought of as “the leader” and the other one as “the follower”. This situation is studied in the paper, with one of the cost functions being of the controllability type. Existence and uniqueness is proven. The optimality system is given in the paper. Dedicated to the memory of Professor K G Ramanathan     

On the nature of the de Branges Hamiltonian

We prove the theorem announced by the author in 1995 in the paper “A criterion for the discreteness of the spectrum of a singular canonical system” (Funkts. Anal. Prilozhen., 29, No. 3).In developing the theory of Hilbert spaces of entire functions (we call them Krein-de Branges spaces), de Branges arrived at a certain class of canonical equations of phase dimension 2. He showed that, for any given Krein-de Branges space, there exists a canonical equation of the class indicated that restores a chain of Krein-de Branges spaces imbedded one into another. The Hamiltonians of such canonical equations are called de Branges Hamiltonians. The following question arises: Under what conditions will the Hamiltonian of a certain canonical equation be a de Branges Hamiltonian? The main theorem of the present work, together with Theorem 1 of the paper cited above, gives an answer to this question.     

Stackelberg–Nash exact controllability for the Kuramoto–Sivashinsky equation

This paper deals with a hierarchical control problem for the Kuramoto–Sivashinsky equation following a Stackelberg–Nash strategy. We assume that there is a main control, called the leader, and two secondary controls, called the followers. The leader tries to drive the solution to a prescribed target and the followers intend to be a Nash equilibrium for given functionals. It is known that this problem is equivalent to a null controllability result for an optimality system consisting of three non-linear equations. One of the novelties is a new Carleman estimate for a fourth-order equation with right-hand sides in Sobolev spaces of negative order, which allows to relax some geometric conditions for the observation sets for the followers.     

Sequences,claws and cyclability of graphs

A subset S of vertices of a graph G is called cyclable in G if there is in G some cycle containing all the vertices of S. We give two results on the cyclability of a vertex subset in graphs, one of which is related to “hamiltonian-nice-sequence” conditions and the other of which is related to “claw-free” conditions. They imply many known results on hamiltonian graph theory. Moreover, the analogous results related to the hamilton-connectivity or to the existence of dominating cycle are also given. © 1996 John Wiley & Sons, Inc.     

Eichler integrals, period relations and Jacobi forms

This paper contains three main results: the first one is to derive two “period relations” and the second one is a complete characterization of period functions of Jacobi forms in terms of period relations. These are done by introducing a concept of “Jacobi integrals” on the full Jacobi group. The last one is to show, for the given holomorphic function P(τ, z) having two period relations, there exists a unique Jacobi integral, up to Jacobi forms, with a given function P(τ, z) as its period function. This is done by constructing a generalized Jacobi Poincaré series explicitly. This is to say that every holomorphic function with “period relations” is coming from a Jacobi integral. It is an analogy of Eichler cohomology theory studied in Knopp (Bull Am Math Soc 80:607–632, 1974) for the functions with elliptic and modular variables. It explains the functional equations satisfied by the “Mordell integrals” associated with the Lerch sums (Zwegers in Mock theta functions, PhD thesis, Universiteit Utrecht, 2002) or, more generally, with the higher Appell functions (Semikhatov et?al. in Commun Math Phys 255(2):469–512, 2005). Developing theories of Jacobi integrals with elliptic and modular variables in this paper is a natural extension of the Eichler integral with modular variable. Period functions can be explained in terms of the parabolic cohomology group as well.     

The construction of all locally compact extensions

The paper presents one of the ways to construct all the locally compact extensions of a given Tychonoff space T. First, there proved the “local” variant of the Stone-C?ech theorem on “completely regular” Riesz spaces X(T) of continuous bounded functions on T with no unit function, in general, but with a collection of local units. In Theorem 1 it is proved that all the functions from X(T) can be “completely regularly” extended on the largest locally compact extension β_xT. Theorem 3 states, that β_xT are presenting, in fact, all the locally compact extensions of T.     

On the Time Consistency of Equilibria in a Class of Additively separable Differential Games

A class of state-redundant differential games is detected, where players can be partitioned into two groups, so that the state dynamics and the payoff functions of all players are additively separable w.r.t. controls and states of any two players belonging to different groups. We prove that, in this class of games, open-loop Nash and feedback Stackelberg equilibria coincide, both being strongly time consistent. This allows us to bypass the issue of the time inconsistency that typically affects the open-loop Stackelberg solution.     

The complete classification of fibres in pencils of curves of genus two

This article contains geometrical classification of all fibres in pencils of curves of genus two, which is essentially different from the numerical one given by Ogg ([11]) and Iitaka ([7]). Given a family π:X→D of curves of genus two which is smooth overD′=D?{0}, we define a multivalued holomorphic mapT _π fromD′ into the Siegel upper half plane of degree two, and three invariants called “monodromy”, “modulus point” and “degree”. We assert that the family π is completely determined byT _π, and its singular fibre by these three invariants. Hence all types of fibres are classified by these invariants and we list them up in a table, which is the main part of this article.     

Qualitative stability of linear systems

This paper provides a finitely computable graph-theoretic answer to the following question concerning linear dynamical systems: When, given only the signs of entries (+, -, or 0) in a real square matrix A, can one be certain that all positive trajectories of the system ẋ = Ax are bounded? Matrices having such sign-patterns are called sign-quasistable. With “bounded” replaced by “convergent to the origin,” the matrices are called sign-stable and were fully described in earlier papers. However, when A's digraph has several strong components, so that the system is actually a hierarchy of subsystems, and when some of those subsystems fail to be sign-stable, the recognition of sign-quasistability is a very delicate matter. By means of certain graph color tests, it is possible to identify the system variables that are capable (for some choice of matrix-entry magnitudes and initial conditions) of emitting nonzero constant     

Sémantique de type Kripke d'un système logique basé sur un ensemble ordonné fini

In order to modelize the reasoning of intelligent agents represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems the use of a set of constants constitutes a fundamental tool. We have introduced in [8] a logic system called without this kind of constants but limited to the case that T is a finite poset. We have proved a completeness result for this system w.r.t. an algebraic semantics. We introduce in this paper a Kripke‐style semantics for a subsystem of for which there existes a deduction theorem. The set of “possible worldsr is enriched by a family of functions indexed by the elements of T and satisfying some conditions. We prove a completeness result for system with respect to this Kripke semantics and define a finite Kripke structure that characterizes the propositional fragment of logic . We introduce a reational semantics (found by E. Orlowska) which has the advantage to allow an interpretation of the propositionnal logic using only binary relations. We treat also the computational complexity of the satisfiability problem of the propositional fragment of logic .     

Semialgebraic complexity of functions

In this paper we study the rate of the best approximation of a given function by semialgebraic functions of a prescribed “combinatorial complexity”. We call this rate a “Semialgebraic Complexity” of the approximated function. By the classical Approximation Theory, the rate of a polynomial approximation is determined by the regularity of the approximated function (the number of its continuous derivatives, the domain of analyticity, etc.). In contrast, semialgebraic complexity (being always bounded from above in terms of regularity) may be small for functions not regular in the usual sense. We give various natural examples of functions of low semialgebraic complexity, including maxima of smooth families, compositions, series of a special form, etc. We show that certain important characteristics of the functions, in particular, the geometry of their critical values (Morse–Sard Theorem) are determined by their semialgebraic complexity, and not by their regularity.     

Bogoliubov Spectrum of Interacting Bose Gases

We study the large‐N limit of a system of N bosons interacting with a potential of intensity 1/N. When the ground state energy is to the first order given by Hartree's theory, we study the next order, predicted by Bogoliubov's theory. We show the convergence of the lower eigenvalues and eigenfunctions towards that of the Bogoliubov Hamiltonian (up to a convenient unitary transform). We also prove the convergence of the free energy when the system is sufficiently trapped. Our results are valid in an abstract setting, our main assumptions being that the Hartree ground state is unique and nondegenerate, and that there is complete Bose‐Einstein condensation on this state. Using our method we then treat two applications: atoms with “bosonic” electrons on one hand, and trapped two‐dimensional and three‐dimensional Coulomb gases on the other hand. © 2015 Wiley Periodicals, Inc.     

A model of concept formation

At first we model the way an intelligence “I” constructs statements from phrases, and then how “I” interlocks these statements to form a string of statements to attain a concept. These strings of statements are called progressions. That is, starting with an initial stimulating relation between two phrases, we study how “I” forms the first statement of the progression and continues from this first statement to form the remaining statements in these progressions to construct a concept. We assume that “I” retains the progressions that it has constructed. Then we show how these retained progressions provide “I” with a platform to incrementally constructs more and more sophisticated conceptual structures. The reason for the construction of these conceptual structures is to achieve additional concepts. Choice plays a very important role in the progression and concept formation. We show that as “I” forms new concepts, it enriches its conceptual structure and makes further concepts attainable. This incremental attainment of concepts is a way in which we humans learn, and this paper studies the attainability of concepts from previously attained concepts. We also study the ability of “I” to apply its progressions and also the ability of “I” to electively manipulate its conceptual structure to achieve new concepts. Application and elective manipulation requires of “I” ingenuity and insight. We also show that as “I” attains new concepts, the conceptual structures change and circumstances arise where unanticipated conceptual discoveries are attainable. As the conceptual structure of “I” is developed, the logical and structural relationships between concepts embedded in this structure also develop. These relationships help “I” understand concepts in the context of other concepts and help “I₁” communicate to another “I₂” information and concept structures. The conceptual structures formed by “I” give rise to a directed web of statement paths which is called a convolution web. The convolution web provides “I” with the paths along which it can reason and obtain new concepts and alternative ways to attain a given concept.This paper is an extension of the ideas introduced in [1]. It is written to be self-contained and the required background is supplied as needed.     

Entropy extension

We prove an “entropy extension-lifting theorem.” It consists of two inequalities for the covering numbers of two symmetric convex bodies. The first inequality, which can be called an “entropy extension theorem,” provides estimates in terms of entropy of sections and should be compared with the extension property of ?_∞. The second one, which can be called an “entropy lifting theorem,” provides estimates in terms of entropies of projections.     

Numerical analysis of generalised max-plus eigenvalue problems

This paper is concerned with the deterministic discrete-time infinite horizon optimisation problem on a compact metric space with an average cost criterion involving two functions K (the “cost”) and T (the “time”). Firstly, we collect the different characterisations of the value λ in terms of generalised max-plus eigenvalue problem and in terms of linear programming. Secondly, we prove an error bound on λ when the space is discretised.     

Phenomena in Inverse Stackelberg Games,Part 2: Dynamic Problems

Games are considered in which the role of the players is a hierarchical one. Some players behave as leaders, others as followers. Such games are named after Stackelberg. In the current paper, a special type of these games is considered, known in the literature as inverse Stackelberg games. In such games, the leader (or: leaders) announces his strategy as a mapping from the follower (or: followers) decision space into his own decision space. Arguments for studying such problems are given. The routine way of analysis, leading to a study of composed functions, is not very fruitful. Other approaches are given, mainly by studying specific examples. Phenomena in problems with more than one leader and/or follower are studied within the context of the inverse Stackelberg concept. As a side issue, expressions like “two captains on a ship” and “divide and conquer” are given a mathematical foundation.     

A boundary layer theory for diffusively perturbed transport around a heteroclinic cycle

We consider a two‐dimensional transport equation subject to small diffusive perturbations. The transport equation is given by a Hamiltonian flow near a compact and connected heteroclinic cycle. We investigate approximately harmonic functions corresponding to the generator of the perturbed transport equation. In particular, we investigate such functions in the boundary layer near the heteroclinic cycle; the space of these functions gives information about the likelihood of a particle moving a mesoscopic distance into one of the regions where the transport equation corresponds to periodic oscillations (i.e., a “well” of the Hamiltonian). We find that we can construct such approximately harmonic functions (which can be used as “corrector functions” in certain averaging questions) when certain macroscopic “gluing conditions” are satisfied. This provides a different perspective on some previous work of Freidlin and Wentzell on stochastic averaging of Hamiltonian systems. © 2004 Wiley Periodicals, Inc.