Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 14 of 14 for “"Spieltheorie"”.

  1. Netzwerk-Verfassungen : institutionelle Lösungsansätze zur Überwindung kollektiver Handlungsprobleme in Verbundnetzwerken

    … Auf Basis der Theorie kollektiver Güter und der Spieltheorie wird untersucht, wie Netzwerk-Verfassungen zur Überwindung kollektiver Handlungsprobleme in Verbundnetzwerken beitragen können. Sie werden in Probleme der Koordination, Einigung, Defektion und Verteilung in der Produktion und Nutzung …

    oldenburg Repository record for Netzwerk-Verfassungen : institutionelle Lösungsansätze zur Überwindung kollektiver Handlungsprobleme in Verbundnetzwerken (opens in a new tab)

  2. Dynamic selfish routing

    This thesis deals with dynamic, load-adaptive rerouting policies in game theoretic settings. In the Wardrop model, which forms the basis of our dynamic population model, each of an infinite number of agents injects an infinitesimal amount of flow into a network, which in turn induces latency on the …

    aachen Repository record for Dynamic selfish routing (opens in a new tab)

  3. Aspects of Wardrop equilibria

    Global communication networks like the Internet often lack a central authority that monitors and regulates network traffic. Network users may behave selfishly according to their private interest without regard to the overall system performance. Such highly complex environments prompted a paradigm …

    aachen Repository record for Aspects of Wardrop equilibria (opens in a new tab)

  4. Stabilizability, controllability and optimal strategies of linear and nonlinear dynamical games

    In this work we investigate besides the optimal control theory, also dynamic game theory in case of linear and nonlinear differential systems. In Chapter 1 the most important results of the linear control theory are presented, whereby also for some classical statements modified proof and resuming …

    aachen Repository record for Stabilizability, controllability and optimal strategies of linear and nonlinear dynamical games (opens in a new tab)

  5. Games and logical expressiveness

    For the study of interactive systems, game theory provides a framework of versatile models and intuitive languages to abstract from the intricacies of distributed control. The effectiveness of this framework relies on logical foundations that allow rigorous specification and reasoning in terms of …

    aachen Repository record for Games and logical expressiveness (opens in a new tab)

  6. Strategien in unendlichen Spielen mit Liveness-Gewinnbedingungen : Syntheseverfahren, Optimierung und Implementierung

    In this thesis we develop methods for the solution of infinite games and present implementations of corresponding algorithms in the framework of a platform for the experimental study of automata theoretic algorithms. Our focus is on games with winning conditions that express certain liveness …

    aachen Repository record for Strategien in unendlichen Spielen mit Liveness-Gewinnbedingungen : Syntheseverfahren, Optimierung und Implementierung (opens in a new tab)

  7. On the complexity of equilibria in games with succinct representation

    Algorithmic game theory studies computational and algorithmic questions arising from the behavior of players in strategic situations. The computational aspects of game theory became subject to closer scrutiny in the last two decades. One reason for this is certainly the advent of large scale …

    aachen Repository record for On the complexity of equilibria in games with succinct representation (opens in a new tab)

  8. Nash equilibria and improvement dynamics in congestion games

    Communication infrastructures and markets are maintained and used by millions of entities each of them facing a private objective. The vast number of participants in conjunction with their individual goals to choose the best alternative gave rise to study such scenarios in the framework of game …

    aachen Repository record for Nash equilibria and improvement dynamics in congestion games (opens in a new tab)

  9. Prediction games : machine learning in the presence of an adversary

    In many applications one is faced with the problem of inferring some functional relation between input and output variables from given data. Consider, for instance, the task of email spam filtering where one seeks to find a model which automatically assigns new, previously unseen emails to class …

    potsdam-diss Repository record for Prediction games : machine learning in the presence of an adversary (opens in a new tab)

  10. Simulation der langfristigen Entwicklung des europäischen Elektrizitätsmarktes

    Due to the liberalization of the European electricity market, boundary conditions for market participants have changed significantly. In order to reach the long-term goal of a European internal market for electricity, strong political measures are necessary in all electricity markets within the …

    aachen Repository record for Simulation der langfristigen Entwicklung des europäischen Elektrizitätsmarktes (opens in a new tab)

  11. Algorithmic railway capacity allocation in a competitive European railway market

    The induced liberalisation process within the European railway system severely affects the railway infrastructure capacity allocation procedure. In the past a single and often governmental owned integrated railway company planned, built and operated a national railway system. The liberalisation …

    aachen Repository record for Algorithmic railway capacity allocation in a competitive European railway market (opens in a new tab)

  12. Logic and games on automatic structures

    The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to show that the formula is true and the other trying to prove it false. This correspondence is exploited algorithmically to evaluate formulas of first and second-order logic on finite structures. We …

    aachen Repository record for Logic and games on automatic structures (opens in a new tab)

  13. The complexity of Nash Equilibria, Local Optima, and Pareto-Optimal solutions

    An instance of a combinatorial optimization problem is usually described by an objective function that is to be optimized over a set of feasible solutions. The decisions that economic entities face every day are more complex for various reasons: In many situations, there is more than one objective …

    aachen Repository record for The complexity of Nash Equilibria, Local Optima, and Pareto-Optimal solutions (opens in a new tab)