Related papers: Monotone Comparative Statics without Lattices
We introduce a novel class of Nash equilibrium seeking dynamics for non-cooperative games with a finite number of players, where the convergence to the Nash equilibrium is bounded by a KL function with a settling time that can be upper…
It has long been conjectured that certain supersymmetric Yang-Mills (SYM) theories provide us with nonperturbative formulations of the string/M-theory. Although the supersymmetry (SUSY) on lattice is notoriously difficult in general, for a…
We explore the phase diagram of the SU(2) Yang-Mills theory in 5 dimensions by numerical simulations. The lattice system shows a dimensionally-reduced phase where the extra dimension is small compared to the four dimensional correlation…
Contrary to the customary view that the celebrated Nash-equilibrium theorem in Game Theory is paradigmatic for non-cooperative games, it is shown that, in fact, it is essentially based on a particularly strong cooperation assumption.…
While there is a well developed theory of locally solid topologies, many important convergences in vector lattice theory are not topological. Yet they share many properties with locally solid topologies. Building upon the theory of…
We introduce a notion of subgames for stochastic timing games and the related notion of subgame-perfect equilibrium in possibly mixed strategies. While a good notion of subgame-perfect equilibrium for continuous-time games is not available…
We provide an introduction to recent lattice formulations of supersymmetric theories which are invariant under one or more real supersymmetries at nonzero lattice spacing. These include the especially interesting case of ${\cal N}=4$ SYM in…
A lattice is a set of all the integer linear combinations of certain linearly independent vectors. One of the most important concepts on lattice is the successive minima which is of vital importance from both theoretical and practical…
Concurrent stochastic games (CSGs) are an ideal formalism for modelling probabilistic systems that feature multiple players or components with distinct objectives making concurrent, rational decisions. Examples include communication or…
Coordination games have been of interest to game theorists, economists, and ecologists for many years to study such problems as the emergence of local conventions and the evolution of cooperative behavior. Approaches for understanding the…
A multi-component lattice Boltzmann model recently introduced (R. Benzi et al. Phys. Rev. Lett 102, 026002 (2009)) to describe some dynamical behaviors of soft-flowing materials is theoretically analyzed. Equilibrium and transport…
In two player bi-matrix games with partial monitoring, actions played are not observed, only some messages are received. Those games satisfy a crucial property of usual bi-matrix games: there are only a finite number of required (mixed)…
A lattice-theoretic framework is introduced that permits the study of the conditional independence (CI) implication problem relative to the class of discrete probability measures. Semi-lattices are associated with CI statements and a…
A lattice-theoretic framework is introduced that permits the study of the conditional independence (CI) implication problem relative to the class of discrete probability measures. Semi-lattices are associated with CI statements and a…
We present a numerical study of the dynamics of a non-ideal fluid subject to a density-dependent pseudo-potential characterized by a hierarchy of nested attractive and repulsive interactions. It is shown that above a critical threshold of…
The major obstacle to a supersymmetric theory on the lattice is the failure of the Leibniz rule. We analyze this issue by using the Wess-Zumino model and a general Ginsparg-Wilson operator, which is local and free of species doublers. We…
Automated verification techniques for stochastic games allow formal reasoning about systems that feature competitive or collaborative behaviour among rational agents in uncertain or probabilistic settings. Existing tools and techniques…
We study the subclass of singleton congestion games with identical and increasing cost functions, i.e., each agent tries to utilize from the least crowded resource in her accessible subset of resources. Our main contribution is a novel…
We establish that algorithmic experiments in zero-sum games "fail miserably" to confirm the unique, sharp prediction of maxmin equilibration. Contradicting nearly a century of economic thought that treats zero-sum games nearly axiomatically…
We consider the stability of synchronized chaos in coupled map lattices and in coupled ordinary differential equations. Applying the theory of Hermitian and positive semidefinite matrices we prove two results that give simple bounds on…