Related papers: The algebra of predicting agents

We prove the almost equivalence of the minimax theorem and the strong duality theorem for a large class of games and conic programs. The previous fundamental results on the equivalence of linear programming and two-player zero-sum games…

We consider a setting where one has to organize one or several group activities for a set of agents. Each agent will participate in at most one activity, and her preferences over activities depend on the number of participants in the…

We establish a correspondence between modules and spans of algebras within a general monoidal 2-category $\mathfrak{C}$. Specifically, for an algebra $A$ in $\mathfrak{C}$, we construct a normalized lax 3-functor from the 2-category of…

This paper studies the relations between agent performances and their intellective abilities in mix-games in which there are two groups of agents: one group plays a minority game, and the other plays a majority game. These two groups have…

Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents…

A duoidal category is a category equipped with two monoidal structures in which one is (op)lax monoidal with respect to the other. In this paper we introduce duoidal $\infty$-categories which are counterparts of duoidal categories in the…

In this paper, we defined two new games - the mildly Menger game and the compact-clopen game. In a zero-dimensional space, the Menger game is equivalent to the mildly Menger game and the compact-open game is equivalent to the compact-clopen…

The strategic selection of resources by selfish agents is a classic research direction, with Resource Selection Games and Congestion Games as prominent examples. In these games, agents select available resources and their utility then…

We introduce the category of optiongraphs and option-preserving maps as a model to study impartial combinatorial games. Outcomes, remoteness, and extended nim-values are preserved under option-preserving maps. We show that the four…

We apply the notion of relative adjoint functor to generalise closed monoidal categories. We define representations in such categories and give their relation with left actions of monoids. The translation of these representations under lax…

Weak bisimulations are typically used in process algebras where silent steps are used to abstract from internal behaviours. They facilitate relating implementations to specifications. When an implementation fails to conform to its…

In computer science, there is a distinction between closed systems, whose behavior is totally determined in advance, and open systems, that are systems maintaining a constant interaction with an unspecified environment. Closed systems are…

Binary multirelations form a model of alternating nondeterminism useful for analysing games, interactions of computing systems with their environments or abstract interpretations of probabilistic programs. We investigate this alternating…

A coherence result for symmetric monoidal closed categories with biproducts is shown in this paper. It is explained how to prove, by using the same technique, coherence for compact closed categories with biproducts and for dagger compact…

In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…

A binary game is introduced and analysed. N players have to choose one of the two sides independently and those on the minority side win. Players uses a finite set of ad hoc strategies to make their decision, based on the past record. The…

In recent work, Watanabe, Eberhart, Asada, and Hasuo have shown that parity games can be seen as string diagrams, that is, as the morphisms of a symmetric monoidal category, an algebraic structure with two different operations of…

In this paper we analyse two-player games by their response graphs. The response graph has nodes which are strategy profiles, with an arc between profiles if they differ in the strategy of a single player, with the direction of the arc…

In this paper I present several algorithmic techniques for improving the decision process of multiple types of agents behaving in environments where their interests are in conflict. The interactions between the agents are modelled by using…

The outcome of many social and economic interactions, such as stock-market transactions, is strongly determined by the predictions that agents make about the behavior of other individuals. Cognitive Hierarchy Theory provides a framework to…