Related papers: Beyond Arbitrary Allocations: Security Values in C…
Teams frequently compete on multiple fronts: political parties contest districts for majority control, contractors field specialized units to win procurement contracts, and squads play match by match for titles. Although the prize accrues…
In competitive resource allocation environments, agents often choose to form alliances; however, for some agents, doing so may not always be beneficial. Is there a method of forming alliances that always reward each of their members? We…
We study a portfolio optimization problem for competitive agents with CRRA utilities and a common finite time horizon. The utility of an agent depends not only on her absolute wealth and consumption but also on her relative wealth and…
From the standpoint of game theory, dominoes is a game that has not received much attention (specially the variety known as draw). It is usually thought that this game is already solved, given general results in game theory. However, the…
Algorithmic game theory (AGT) focuses on the design and analysis of algorithms for interacting agents, with interactions rigorously formalized within the framework of games. Results from AGT find applications in domains such as online…
We consider a constrained, pure exploration, stochastic multi-armed bandit formulation under a fixed budget. Each arm is associated with an unknown, possibly multi-dimensional distribution and is described by multiple attributes that are a…
When modeling robot interactions as Nash equilibrium problems, it is desirable to place coupled constraints which restrict these interactions to be safe and acceptable (for instance, to avoid collisions). Such games are continuous with…
In allocation problems, a given set of goods are assigned to agents in such a way that the social welfare is maximised, that is, the largest possible global worth is achieved. When goods are indivisible, it is possible to use money…
This paper considers the security investment problem over a network in which the resource owners aim to allocate their constrained security resources to heterogeneous targets strategically. Investing in each target makes it less vulnerable,…
Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of players, one of the players wins the game with a certain (a…
We study the multi-armed bandit problem with multiple plays and a budget constraint for both the stochastic and the adversarial setting. At each round, exactly $K$ out of $N$ possible arms have to be played (with $1\leq K \leq N$). In…
The diversity in wealth and social status is present not only among humans, but throughout the animal world. We account for this observation by generating random variables that determ ine the social diversity of players engaging in the…
Many high-stakes AI deployments proceed only if every stakeholder deems the system acceptable relative to their own minimum standard. With randomization over a finite menu of options, this becomes a feasibility question: does there exist a…
How should a robot that collaborates with multiple people decide upon the distribution of resources (e.g. social attention, or parts needed for an assembly)? People are uniquely attuned to how resources are distributed. A decision to…
The security game is a basic model for resource allocation in adversarial environments. Here there are two players, a defender and an attacker. The defender wants to allocate her limited resources to defend critical targets and the attacker…
Self-interested behavior in sharing economies often leads to inefficient aggregate outcomes compared to a centrally coordinated allocation, ultimately harming users. Yet, centralized coordination removes individual decision power. This…
This paper studies a sequential decision problem where payoff distributions are known and where the riskiness of payoffs matters. Equivalently, it studies sequential choice from a repeated set of independent lotteries. The decision-maker is…
In the Colonel Blotto game, which was initially introduced by Borel in 1921, two colonels simultaneously distribute their troops across different battlefields. The winner of each battlefield is determined independently by a winner-take-all…
We study the problem of computing Stackelberg equilibria Stackelberg games whose underlying structure is in congestion games, focusing on the case where each player can choose a single resource (a.k.a. singleton congestion games) and one of…
The Parallel Minority Game (PMG) refers to a set of Minority Games (MG), played in parallel, where each agent only has two choices to pick from, but each choice can host agents of many kind i.e., their other alternative can be from any…