相关论文: Bipartite instances of INFLUENCE

We consider the problem of collaborative inference in a sensor network with heterogeneous and statistically dependent sensor observations. Each sensor aims to maximize its inference performance by forming a coalition with other sensors and…

There are many combinatorial games in which a move can terminate the game, such as a checkmate in chess. These moves give rise to diverse situations that fall outside the scope of the classical normal play structure. To analyze these games,…

We study a wide class of non-convex non-concave min-max games that generalizes over standard bilinear zero-sum games. In this class, players control the inputs of a smooth function whose output is being applied to a bilinear zero-sum game.…

This paper proposes a paradigm shift for affective computing by viewing the affect modeling task as a reinforcement learning process. According to our proposed framework the context (environment) and the actions of an agent define the…

Weighted timed games are played by two players on a timed automaton equipped with weights: one player wants to minimise the accumulated weight while reaching a target, while the other has an opposite objective. Used in a reactive synthesis…

In imperfect information games (e.g. Bridge, Skat, Poker), one of the fundamental considerations is to infer the missing information while at the same time avoiding the disclosure of private information. Disregarding the issue of protecting…

We present a concise derivation for several influential score-based diffusion models that relies on only a few textbook results. Diffusion models have recently emerged as powerful tools for generating realistic, synthetic signals --…

Interference exists when a unit's outcome depends on another unit's treatment assignment. For example, intensive policing on one street could have a spillover effect on neighboring streets. Classical randomization tests typically break down…

The biased interaction game described the operation of systems rooted in boundedly rational interactions under conditions of scarcity. The game explored the influence of bias and demonstrated how hierarchy and inequality are emergent system…

We study a modified version of the Naming Game, a recently introduced model which describes how shared vocabulary can emerge spontaneously in a population without any central control. In particular, we introduce a new mechanism that allows…

In this paper we introduce a novel flow representation for finite games in strategic form. This representation allows us to develop a canonical direct sum decomposition of an arbitrary game into three components, which we refer to as the…

In repeated-game applications where both the collusive and non-collusive outcomes can be supported as equilibria, researchers must resolve underlying selection questions if theory will be used to understand counterfactual policies. One…

A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints,…

Bayesian regression games are a special class of two-player general-sum Bayesian games in which the learner is partially informed about the adversary's objective through a Bayesian prior. This formulation captures the uncertainty in regard…

Since the Fourth Industrial Revolution, AI technology has been widely used in many fields, but there are several limitations that need to be overcome, including overfitting/underfitting, class imbalance, and the limitations of…

This paper describes a basic model of a gift economy in the shape of a Giving Game and reveals the fundamental structure of such a game. Main result is that the game shows a community effect in that a small subgroup of players eventually…

This paper studies two important signal processing aspects of equilibrium behavior in non-cooperative games arising in social networks, namely, reinforcement learning and detection of equilibrium play. The first part of the paper presents a…

An asymmetric generalization of classical Cournot's duopoly game was introduced and the simulation scheme of its quantized version was analyzed. In this scheme, the player assigned by a 'classical' measurement scheme always wins the player…

Domineering is a combinatorial game played on a subset of a rectangular grid between two players. Each board position can be put into one of four outcome classes based on who the winner will be if both players play optimally. In this note,…

Inspired by the theory of poset games, we introduce a new compound of impartial combinatorial games and provide a complete analysis in the spirit of the Sprague-Grundy theory. Furthermore, we establish several substitution and reduction…