Showing 1 - 10 of 101
In this paper we consider the location of the eigenvalues of the composite matrix ( -A S1 S2 ) ( Q1 At 0 ) ( Q2 0 At ) , where the matrices Si and Qi are assumed to be semi-positive definite. Two interesting observations, which are not or only partially mentioned in literature before, challenge...
Persistent link: https://www.econbiz.de/10011087121
Persistent link: https://www.econbiz.de/10011090552
The aim of the present study is to construct a state feedback controller for a given linear system that minimizes the worst-case effect of an L2 -bounded disturbance. Our setting is different from the usual framework of H -theory in that we consider nonzero initial conditions. The situation is...
Persistent link: https://www.econbiz.de/10011090697
Persistent link: https://www.econbiz.de/10011091692
In this paper we consider open-loop Nash equilibria of the linear-quadratic differential game.As well the finite-planning-horizon, the infinite-planning horizon as convergence properties of the finite-planning-horizon equilibrium if the planning horizon is extended to infinity are...
Persistent link: https://www.econbiz.de/10011086798
Persistent link: https://www.econbiz.de/10011087206
We describe non-cooperative game models and discuss game theoretic solution<br/>concepts. Some applications are also noted. Conventional theory focuses on the<br/>question ‘how will rational players play?’, and has the Nash equilibrium at its core.<br/>We discuss this concept and its interpretations, as...
Persistent link: https://www.econbiz.de/10011144456
Persistent link: https://www.econbiz.de/10011092577
This paper introduces a simple extensive form pricing game.The Bertrand outcome is a Nash equilibrium outcome in this game, but it is not necessarily subgame perfect.The subgame perfect equilibrium outcome features the following comparative static properties.The more similar firms are, the...
Persistent link: https://www.econbiz.de/10011092583
This paper analyzes convex congestion network problems.It is shown that for network problems with convex congestion costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition. Furthermore an easy way of determining if a given network is...
Persistent link: https://www.econbiz.de/10011092611