相关论文: Relations Between a Topological Game and the $G_{\…
In this note we study the open-point topological games in order to analyze the least upper bound for density of dense subsets of a topological space. This way we may also analyze the behavior of such cardinal invariants in taking products…
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing dependencies induced by quantifications in first-order…
This paper explores various homological regularity phenomena (in the sense of Auslander) in category $\mathcal{O}$ and its several variations and generalizations. Additionally, we address the problem of determining projective dimension of…
A player's payoff is modeled as consisting of two parts: a rational-value part and a distortion-value part. It is argued that the (total) payoff function should be used to explain and predict the behaviors of the players, while the rational…
The central idea of metamaterials and metaoptics is that, besides their base materials, the geometry of structures offers a broad extra dimension to explore for exotic functionalities. Here, we discover that the topology of structures…
We introduce the notion of exchangeable equilibria of a symmetric bimatrix game, defined as those correlated equilibria in which players' strategy choices are conditionally independently and identically distributed given some hidden…
A principal must allocate a set of heterogeneous tasks (or objects) among multiple agents. The principal has preferences over the allocation. Each agent has preferences over which tasks they are assigned, which are their private…
Evolutionary game theory is a powerful framework for studying evolution in populations of interacting individuals. A common assumption in evolutionary game theory is that interactions are symmetric, which means that the players are…
We introduce operational semantics into games. And based on the operational semantics, we establish a full algebra of games, including basic algebra of games, algebra of concurrent games, recursion and abstraction. The algebra can be used…
Purpose: We propose a model to present a possible mechanism for obtaining sizeable behavioural structures by simulating an agent based on the evolutionary public good game with available social learning. Methods: The model considered a…
We study links between first-order formulas and arbitrary properties for families of theories, classes of structures and their isomorphism types. Possibilities for ranks and degrees for formulas and theories with respect to given properties…
We consider ordinary differential equations on the unit simplex of $\RR^n$ that naturally occur in population games, models of learning and self reinforced random processes. Generalizing and relying on an idea introduced in \cite{DF11}, we…
We discuss possible relationships between geometric and topological interactions on one side and physical interactions on the other side.
For a topological space $X$ and a point $x \in X$, consider the following game -- related to the property of $X$ being countably tight at $x$. In each inning $n\in\omega$, the first player chooses a set $A_n$ that clusters at $x$, and then…
The Colonel Blotto game, introduced by Borel in the 1920s, is often used for modeling various real-life settings, such as elections, lobbying, etc. The game is based on the allocation of limited resources by players to a set of fields. Each…
The classical paradox of social choice theory asserts that there is no fair way to deterministically select a winner in an election among more than two candidates; the only definite collective preferences are between individual pairs of…
We investigate a game-theoretic model of a social system where both the rules of the game and the interaction structure are shaped by the behavior of the agents. We call this type of model, with several types of feedback couplings from the…
In this article, we investigate properties of digital H-spaces in the graph theoretic model of digital topology. As in prior work, the results obtained often depend fundamentally on the choice between NP$_1$ and NP$_2$ product adjacencies.…
In this paper, we discuss some properties of of $G$-hull, $G$-kernel and $G$-connectedness, and extend some results of \cite{life34}. In particular, we prove that the $G$-connectedness are preserved by countable product. Moreover, we…
Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwanger, this concept can be soundly extended to infinite games…