Related papers: Multiplayer boycotts in convex games

This paper considers convex games involving multiple agents that aim to minimize their own cost functions using locally available information. A common assumption in the study of such games is that the agents are symmetric, meaning that…

We study a game where two players take turns selecting points of a convex geometry until the convex closure of the jointly selected points contains all the points of a given winning set. The winner of the game is the last player able to…

We study the public goods game in the noisy case by considering the players with inhomogeneous activity teaching on a square lattice. It is shown that the introduction of the inhomogeneous activity of teaching of the players can remarkably…

An important task in the analysis of multiagent systems is to understand how groups of selfish players can form coalitions, i.e., work together in teams. In this paper, we study the dynamics of coalition formation under bounded rationality.…

This paper investigates whether the decoy effect - specifically the attraction effect - can foster cooperation in social networks. In a lab experiment, we show that introducing a dominated option increases the selection of the target…

In this work we study of competitive situations among users of a set of global resources. More precisely we study the effect of cost policies used by these resources in the convergence time to a pure Nash equilibrium. The work is divided in…

Most governments employ a set of quasi-standard measures to fight COVID-19 including wearing masks, social distancing, virus testing, contact tracing, and vaccination. However, combining these measures into an efficient holistic pandemic…

The present study explores a problem that can be resolved by employing the notion of a partially defined cooperative game, yet cannot by using a restricted game. The following situation is considered: First, it is assumed that the worth of…

We study a cooperative game setting where the grand coalition may change since the initial players can invite more players. We focus on monotone games, i.e., adding more players to the grand coalition is not harmful. We model the invitation…

Assistance games (also known as cooperative inverse reinforcement learning games) have been proposed as a model for beneficial AI, wherein a robotic agent must act on behalf of a human principal but is initially uncertain about the humans…

We study noncooperative games, in which each player's objective is composed of a sequence of ordered- and potentially conflicting-preferences. Problems of this type naturally model a wide variety of scenarios: for example, drivers at a busy…

We introduce and study an evolutionary complementarity game where in each round a player of population 1 is paired with a member of population 2. The game is symmetric, and each player tries to obtain an advantageous deal, but when one of…

This paper proposes a framework and solution concept for repeated coalitional behavior. We model history-dependent schemes that deter coalitions from blocking using continuation promises and punishments. We evaluate the effectiveness of…

We investigate a traffic assignment problem on a transportation network, considering both the demands of individual drivers and of a large fleet controlled by a central operator (minimizing the fleet's average travel time). We formulate…

We consider a coalitional game with the same payoff for all players. To maximize the payoff, the players need to use one collective strategy, if all players are in certain states, and the other strategy otherwise. The current state of each…

We consider three variants of a partisan combinatorial game between two players, Left and Right, played on an undirected simple graph. Left is able to delete vertices (and incident edges) while Right is able to delete edges. This natural…

A patient player privately observes a persistent state that directly affects his myopic opponents' payoffs, and can be one of the several commitment types that plays the same mixed action in every period. I characterize the set of…

We study a modification of the so-called Parrondo's paradox where a large number of individuals choose the game they want to play by voting. We show that it can be better for the players to vote randomly than to vote according to their own…

We introduce a game where players selfishly choose a resource and endure a cost depending on the number of players choosing nearby resources. We model the influences among resources by a weighted graph, directed or not. These games are…

The rise of artificial intelligence (AI) offers new opportunities to influence cooperative dynamics with greater applicability and control. In this paper, we examine the impact of third-party bots--agents that do not directly participate in…