A note on the relationship between the isotone assumption of the Abian-Brown fixed point theorem and Abian’s most basic fixed point theorem

In a recent paper Xie et al. (Fixed Point Theory Appl. 2013:192, 2013) gave several extensions and some applications of the Abian-Brown (AB) fixed point theorem. While the AB fixed point theorem and its extensions (as well as other related fixed point theorems) assume that the mapping is isotone, this note shows that for single-valued finite maps this condition relates to the acyclicity of the map, which in turn relates to Abian’s (Nieuw Arch. Wiskd. XVI:184-185, 1968) most basic fixed point theorem for finite sets

Essays in technology gap and process spillovers at the firm level

Ph.DDOCTOR OF PHILOSOPH

A note on the relationship between graphs and information protocols

Information protocols (IP’s) were developed to describe players who learn their social situation by their experiences. Although IP’s look similar to colored multi-graphs (MG’s), the two objects are constructed in fundamentally different ways. IP’s are constructed using the global concept of history, whereas graphs are constructed using the local concept of edges. We give necessary and sufficient conditions for each theory to be captured by the other. We find that the necessary and sufficient condition for IP theory to be captured by MG theory, which we call SE, excludes relevant game situations. Hence, we conclude that IP theory remains a vital tool and cannot be replaced by MG theory

Equivalence between graph-based and sequence-based extensive form games

This note establishes an equivalence between the graph-based definition of an infinite extensive form game [following Kuhn (Contributions to the theory of games II, Princeton: Princeton University Press, pp 193–216, 1953)] and the sequence based definition by Osborne and Rubinstein (A course in game theory, Cambridge: MIT Press, 1994)

Frontiers in games and dynamic games: theory, applications, and numerical methods

This contributed volume presents the state-of-the-art of games and dynamic games, featuring several chapters based on plenary sessions at the ISDG-China Chapter Conference on Dynamic Games and Game Theoretic Analysis, which was held from August 3-5, 2017 at the Ningbo campus of the University of Nottingham, China. The chapters in this volume will provide readers with paths to further research, serving as a testimony to the vitality of the field. Experts cover a range of theory and applications related to games and dynamic games, with topics including: Dynamically stable cooperative provision of public goods under non-transferable utility Strongly time-consistent solutions in cooperative dynamic games Incentive Stackelberg games for stochastic systems Static and inverse Stackelberg games in political economy Cournot and Betrand competition on symmetric R&D networks Numerical Nash equilibria using curvilinear multistart algorithm Markov chain approximation numerical scheme for infinite-horizon mean field games Frontiers in Games and Dynamic Games will appeal to an interdisciplinary audience of researchers, practitioners, and graduate students interested in games and dynamic games

A Note on Some Weaker Notions of Cop-Win and Robber-Win Graphs

The game of pursuit and evasion, when played on graphs, is often referred to as the game of cops and robbers. This classical version of the game has been completely solved by Nowakowski and Winkler, who gave the exact class of graphs for which the pursuer can win the game (cop-win). When the graph does not satisfy the dismantlability property, Nowakowski and Winkler’s Theorem does not apply. In this paper, we give some weaker notions of cop-win and robber-win graphs. In particular, we fix the number of cops to be equal to one, and we ask whether there exist sets of initial conditions for which the graph can be cop-win or robber-win. We propose some open questions related to this initial condition problem with the goal of developing both structural characterizations and algorithms that are computable in polynomial time (P) and that can solve weakly cop-win and weakly- robber-win graphs

A Note on Some Weaker Notions of Cop-Win and Robber-Win Graphs

The game of pursuit and evasion, when played on graphs, is often referred to as the game of cops and robbers. This classical version of the game has been completely solved by Nowakowski and Winkler, who gave the exact class of graphs for which the pursuer can win the game (cop-win). When the graph does not satisfy the dismantlability property, Nowakowski and Winkler’s Theorem does not apply. In this paper, we give some weaker notions of cop-win and robber-win graphs. In particular, we fix the number of cops to be equal to one, and we ask whether there exist sets of initial conditions for which the graph can be cop-win or robber-win. We propose some open questions related to this initial condition problem with the goal of developing both structural characterizations and algorithms that are computable in polynomial time (P) and that can solve weakly cop-win and weakly- robber-win graphs