6 documents found

Research Results
All rights reserved
2024

A Testbed for Solution Concepts of Dynamic Games with Incomplete Preferences

As far as we know, the identiifcation of all Nash paths for dynamic games has not been treated intensively. The reason seems to be that subgame perfect equilibrium is broadly accepted as an expedient solution concept, which is on top of that easy to handle. Any other equilibrium concept is sometimes…
Research Results
All rights reserved
2024

Does the Nash Solution Concept persist for Intelligent Agents in a Dynamic Game Environment?

Dynamic Games offer a suitable test bed to analyze strategic behavior of intelligent agents. Experimental Mathematics provides the methods to explore a model of perception and reaction. We study the effect of Artificial Intelligence on decision making of agents, who observe the relative frequencies of…
Research Results
All rights reserved
2023

Risk-Averse Agents in Dynamic Games

We introduce a concept of equilibrium for dynamic games, which reflects risk-aversion for the agents playing the game. We assume given preferences for the agents rather than utility functions and allow the formation of coalitions. It turns out that risk-averse behavior is generally not covered by subgame…
Research Results
All rights reserved
2023

All You need is Nash

At the first glance the question sounds funny. Some economists might perhaps say "All You need is Cash". But from the mathematical point of view there is indeed a serious reason to reflect on the internal structure of games. Apart from the Nash solution for non-cooperative games, the concept of Correlated…
Research Results
All rights reserved
2022

Arrangement of Nash Equilibria in Dynamic Games by Coalition Formation

The broadly accepted equilibrium concept for non-cooperative games in extensive form draws on subgame perfectness. Existence of such an equilibrium is assured under weak assumptions. But in most situations many other Nash Equilibria may exist. Hence, there must be some tacit agreement of groups of players,…
Research Results
All rights reserved
2019

Selection of Cluster Heads within Communication Networks by Voting Schemes

We consider totally connected networks of nodes forming a cluster within a broader community of agents exchanging messages. These networks are also addressed by mesh networks. We examine a scenario where the community is partitioned into multiple clusters, in each cluster one node acting as cluster head.…