1,907 research outputs found

    Universal Nash Equilibrium Strategies for Differential Games

    Full text link
    The paper is concerned with a two-player nonzero-sum differential game in the case when players are informed about the current position. We consider the game in control with guide strategies first proposed by Krasovskii and Subbotin. The construction of universal strategies is given both for the case of continuous and discontinuous value functions. The existence of a discontinuous value function is established. The continuous value function does not exist in the general case. In addition, we show the example of smooth value function not being a solution of the system of Hamilton--Jacobi equation.Comment: 23 page

    Rothe method and numerical analysis for history-dependent hemivariational inequalities with applications to contact mechanics

    Get PDF
    In this paper an abstract evolutionary hemivariational inequality with a history-dependent operator is studied. First, a result on its unique solvability and solution regularity is proved by applying the Rothe method. Next, we introduce a numerical scheme to solve the inequality and derive error estimates. We apply the results to a quasistatic frictional contact problem in which the material is modeled with a viscoelastic constitutive law, the contact is given in the form of multivalued normal compliance, and friction is described with a subgradient of a locally Lipschitz potential. Finally, for the contact problem we provide the optimal error estimate

    Strong and safe Nash equilibrium in some repeated 3-player games

    Full text link
    We consider a 3-player game in the normal form, in which each player has two actions. We assume that the game is symmetric and repeated infinitely many times. At each stage players make their choices knowing only the average payoffs from previous stages of all the players. A strategy of a player in the repeated game is a function defined on the convex hull of the set of payoffs. Our aim is to construct a strong Nash equilibrium in the repeated game, i.e. a strategy profile being resistant to deviations by coalitions. Constructed equilibrium strategies are safe, i.e. the non-deviating player payoff is not smaller than the equilibrium payoff in the stage game, and deviating players' payoffs do not exceed the non-deviating player payoff more than a positive constant which can be arbitrary small and chosen by the non-deviating player. Our construction is inspired by Smale's good strategies described in \cite{smale}, where the repeated Prisoner's Dilemma was considered. In proofs we use arguments based on approachability and strong approachability type results.Comment: 19 page
    corecore