Results 291 to 300 of about 50,036 (314)
Some of the next articles are maybe not open access.
Dynamic Leveraging–Deleveraging Games
Operations Research, 2020We endogenize the dynamics of a large borrower’s leverage based on a new type of game among the lender, the leveraging/deleveraging game. Leverage is mean reverting around a long-run level and explosive above an instability level. This is driven by the changing nature of the lenders’ game from strategic substitutability to one-sided strategic ...
Andreea Minca, Johannes Wissel
openaire +1 more source
DYNAMIC GAMES WITH COALITIONAL STRUCTURES [PDF]
The paper explores the properties of multistage games with perfect information, in which (unlike the classic Kuhnian definition) the conditional coalition partition at any vertex is determined by a chance move and remains unchanged until the random process repeats at the next vertex. A new value for such a game is proposed in terms of a PMS-vector. It
LEON PETROSJAN, SVETLANA MAMKINA
openaire +1 more source
Dynamic resource allocation games
Theoretical Computer Science, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guy Avni +2 more
openaire +1 more source
Dynamics in network interaction games
Distributed Computing, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Hoefer 0001, Siddharth Suri
openaire +1 more source
2015
In this chapter repeated and dynamic games will be discussed in which the players know the strategy sets and payoff functions of all players, that is, the game has complete information. It is also assumed that at each time period each player knows the complete history of the game which consists of the past strategy selections and corresponding payoff ...
Akio Matsumoto, Ferenc Szidarovszky
openaire +1 more source
In this chapter repeated and dynamic games will be discussed in which the players know the strategy sets and payoff functions of all players, that is, the game has complete information. It is also assumed that at each time period each player knows the complete history of the game which consists of the past strategy selections and corresponding payoff ...
Akio Matsumoto, Ferenc Szidarovszky
openaire +1 more source
Journal of Logic, Language and Information, 1992
Two examples demonstrate the possibility of extremely complicated non-convergent behavior in evolutionary game dynamics. For the Taylor-Jonker flow, the stable orbits for three strategies were investigated by Zeeman. Chaos does not occur with three strategies.
openaire +1 more source
Two examples demonstrate the possibility of extremely complicated non-convergent behavior in evolutionary game dynamics. For the Taylor-Jonker flow, the stable orbits for three strategies were investigated by Zeeman. Chaos does not occur with three strategies.
openaire +1 more source
Designing Efficient Mechanisms for Dynamic Bilateral Trading Games
American Economic Review, 2007Susan Athey, Ilya Segal, Athey Susan
exaly
Avoiding the curse of dimensionality in dynamic stochastic games
Quantitative Economics, 2012Ulrich Doraszelski
exaly

