Regular Equilibria and Negative Welfare Implications in Delegation Games

2019 ◽  
Vol 20 (1) ◽  
Author(s):  
Tomoya Tajika

AbstractThis study examines delegation games in which each player commits to a reaction function in advance. We focus on the regular subgame perfect equilibria of delegation games in the sense that the chosen reaction functions have an invertible Jacobian. Subsequently we provide a necessary condition under which an action profile is achieved as a regular equilibrium of n-player delegation games. In two-player games with misaligned preferences, each efficient action profile violates the necessary condition. We also show that almost action profiles other than efficient ones are achieved as regular equilibria of the delegation game in which the chosen reaction functions are linear. This finding implies that each delegatee’s objective is written as a quadratic function, which may justify the linear-quadratic specification of the objective functions in applications.

Author(s):  
Benoit Duvocelle ◽  
János Flesch ◽  
Hui Min Shi ◽  
Dries Vermeulen

AbstractWe consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Jie Xu ◽  
Ruiqiang Lin

In this paper, we study a kind of near optimal control problem which is described by linear quadratic doubly stochastic differential equations with time delay. We consider the near optimality for the linear delayed doubly stochastic system with convex control domain. We discuss the case that all the time delay variables are different. We give the maximum principle of near optimal control for this kind of time delay system. The necessary condition for the control to be near optimal control is deduced by Ekeland’s variational principle and some estimates on the state and the adjoint processes corresponding to the system.


2009 ◽  
Vol 11 (04) ◽  
pp. 407-417 ◽  
Author(s):  
HUIBIN YAN

Solution uniqueness is an important property for a bargaining model. Rubinstein's (1982) seminal 2-person alternating-offer bargaining game has a unique Subgame Perfect Equilibrium outcome. Is it possible to obtain uniqueness results in the much enlarged setting of multilateral bargaining with a characteristic function? This paper investigates a random-proposer model first studied in Okada (1993) in which each period players have equal probabilities of being selected to make a proposal and bargaining ends after one coalition forms. Focusing on transferable utility environments and Stationary Subgame Perfect Equilibria (SSPE), we find ex ante SSPE payoff uniqueness for symmetric and convex characteristic functions, considerably expanding the conditions under which this model is known to exhibit SSPE payoff uniqueness. Our model includes as a special case a variant of the legislative bargaining model in Baron and Ferejohn (1989), and our results imply (unrestricted) SSPE payoff uniqueness in this case.


2018 ◽  
Vol 76 ◽  
pp. 101-112 ◽  
Author(s):  
P. Jean-Jacques Herings ◽  
Andrey Meshalkin ◽  
Arkadi Predtetchinski

1991 ◽  
Vol 113 (2) ◽  
pp. 206-215 ◽  
Author(s):  
V. Yen ◽  
M. Nagurka

A method for determining the optimal control of unconstrained and linearly constrained linear dynamic systems with quadratic performance indices is presented. The method is based on a modified Fourier series approximation of each state variable that converts the linear quadratic (LQ) problem into a mathematical programming problem. In particular, it is shown that an unconstrained LQ problem can be cast as an unconstrained quadratic programming problem where the necessary condition of optimality is derived as a system of linear algebraic equations. Furthermore, it is shown that a linearly constrained LQ problem can be converted into a general quadratic programming problem. Simulation studies for constrained LQ systems, including a bang-bang control problem, demonstrate that the approach is accurate. The results also indicate that in solving high order unconstrained LQ problems the approach is computationally more efficient and robust than standard methods.


Sign in / Sign up

Export Citation Format

Share Document