<p>This is a masters thesis (20p) in computer science at the University of Linköping. This thesis will give an introduction to what a physics engine is and what it consist of. It will put some engines under the magnifying glass and test them in a couple of runtime tests. Two cutting edge commercial physics engines have been examined, trying to predict the future of physics engines. From the research and test results, an interface for physics engine independency has been implemented for a company called Craft Animations in Gothenburg, Sweden.</p>

This is a masters thesis (20p) in computer science at the University of Linköping. This thesis will give an introduction to what a physics engine is and what it consist of. It will put some engines under the magnifying glass and test them in a couple of runtime tests. Two cutting edge commercial physics engines have been examined, trying to predict the future of physics engines. From the research and test results, an interface for physics engine independency has been implemented for a company called Craft Animations in Gothenburg, Sweden.

Untersuchungsgegenstand dieser Arbeit ist ein spieltheoretisches Modell für die dezentrale Erzeugung von Netzwerken durch eigennützige Agenten. Diese Akteure verfolgen das Ziel, ein zusammenhängendes Netzwerk aufzubauen, welches ihre individuelle Verbindungsqualität maximiert. Direktverbindungen im Netzwerk haben Kosten, weshalb die Agenten ihre Ausgaben für das Erstellen von Direktverbindungen und die damit erzielten Kommunikationskosten ausbalancieren müssen. Dieses Modell wurde vor einem Jahrzehnt von Fabrikant, Luthra, Maneva, Papadimitriou und Shenker eingeführt, um reale Netzwerke, welche aus der Interaktion von eigenützigen Parteien entstanden sind, zu verstehen. Zu solchen Netzwerken zählen das Internet und auch soziale Netzwerke. Die vorliegende Arbeit trägt zu diesem Forschungsvorhaben bei, indem die sogenannten Network Creation Games aus drei Perspektiven betrachtet werden. Die erste Sichtweise ist die Approximationsperspektive. Es wird untersucht, welche Netzwerke von sehr einfachen, in ihrer Berechnungsstärke eingeschränkten Agenten erzeugt werden und wie diese im Vergleich mit Netzwerken von Agenten, die beliebige Berechnungsstärke haben, abschneiden. Als zweite Sichtweise wird die Dynamikperspektive betrachtet. Dazu werden sequentielle Versionen des Modells definiert und anhand dieser wird explizit der Prozess der Netzwerkerzeugung untersucht. Die Hauptfragestellung ist, ob unter der natürlichen Annahme, dass Agenten stets ihre Situation verbessern wollen, der Prozess zu einem Gleichgewicht konvergiert und, falls dem so ist, wie dieser Prozess beschleunigt werden kann. Die Abhandlung wird mit der dritten Sichtweise, der Strukturperspektive, abgerundet. Es werden eine Vielfalt neuer Struktureigenschaften für verschiedene Gleichgewichtskonzepte bewiesen und neue Werkzeuge, die bei der Analyse von Gleichgewichtsnetzwerken mit hohen Direktverbindungskosten hilfreich sind, vorgestellt. / The subject of study in this thesis is a game-theoretic model for decentralized network creation by selfish agents. These agents aim to create a connected network among themselves which maximizes their individual connection quality. Links in the network are costly and therefore agents try to find a trade-off between their cost spent on creating edges and their cost incurred by communicating within the network. This model was proposed a decade ago by Fabrikant, Luthra, Maneva, Papadimitriou and Shenker with the goal of understanding real networks which emerge from the interaction of selfish entities without explicit central coordination, e.g. the Internet or social networks. We contribute to this research endeavor in many ways by considering these so-called Network Creation Games from three perspectives. Our first point of view on these games is the approximation perspective. We analyze which networks are created by very simple computationally bounded selfish agents and how these networks compare to networks built by agents having unlimited computational resources. The second point of view is the dynamics perspective. We turn the model into a sequential version and focus on the process of selfish network creation. For this, we investigate whether natural dynamics like best response dynamics are guaranteed to converge to an equilibrium of the game and if so, how this convergence process may be sped up. We complete the treatment of Network Creation Games with our third point of view: the structure perspective. We provide new structural insights for several equilibrium concepts and introduce new tools which shed light on the structure of equilibrium networks for high edge-cost.

Complexity underlying life is largely governed by the dynamics of interaction within and between living and nonliving entities. Evolutionary strategy games are extensively used in modelling and understanding complex behaviors in a wide range of fields including theoretical biology, social interactions, economics, politics, defense and security. Strategy games are said to distill the key elements of interactions be- tween real-world entities and organizations - one of the challenges lies in determining the mapping of complex real life situation dynamics to that of a certain game. That leads us to the two major research questions outlined below. In this thesis, we are taking evolutionary games a step further to investigate the interplay between local and global dynamics, where local dynamics are repre- sented by locally pairwise interactions among the population's players governed by the Iterated Prisoner's Dilemma game. To represent the global dynamics, two main modelling ideas are proposed, in the first model; a mixed evolutionary game is in- troduced where players are competing globally on the population level in a minority game. The interplay between local and global dynamics in this model represents the interplay between different scopes of competition between the same players. Sec- ondly, we introduce a model for studying the effect of sharing global information concerning a population of players, shedding light on how global information can alter the emerging dynamics of local interactions. Furthermore, the thesis addresses the question of whether games - with different dynamics - have unique signatures (footprints) that can be used in recognizing and differentiating among them, and whether these footprints are consistent along the evolutionary path of these games. We show here that by building winning networks between players, and determining network motifs of these winning networks, we can obtain motifs' counts signals that are sufficient to categorize and recognize the game's utility matrix used by the players. We also demonstrate that these footprints - motifs' counts - are consistent along the evolutionary path of the games, due to a hyper-cyclic behavior that exists between strategies. Finally, we show that this approach is capable of identifying whether a certain population is driven by local dynamics or both local and global dynamics using the proposed mixed game.

This report describes my work with developing a game for a gaming platform that enables hybrids between board games and computer games. My ambition has been to develop a game that takes advantage of the novel possibilities that this platform permits. Among those are to operate with a combination of the computer game traits of complexity in the games and ease of playing; as well as the board game / card game traits of combining social dynamics around a game session with ability to keep information hidden from other players. This is accomplished by a combination of mobile phones and a computer connected to the Internet. The screen of the computer will serve as board and the phones will display cards and other private information to the players, as well as functioning as the players' means for interaction with the game. The game developed, Wind Bugs, takes advantage of the complexity of game states that a computer easily can handle. Effort has been put into finding mechanics with a level of complexity while still implementing them in way that makes them both playable and enjoyable. Rather than focusing on immersion, which has become common in the design of computer games, hopes are that games for this platform, including the game developed in this project, will give room to social dynamics among the players. Though operating with the use of mobile phones, the platform will not support "mobile gaming"; the proposed setting is a group of players surrounding a big screen.