Related papers: Characterizations of the position value for hyperg…
Many complex systems that exhibit temporal non-pairwise interactions can be represented by means of generative higher-order network models. Here, we propose a hidden variables formalism to analytically characterize a general class of…
This paper proposes a new lens for studying threshold games played on networks when the thresholds are heterogeneous. These are games where agents have two possible actions, and prefer action 1 if and only if enough of their neighbours…
We consider stochastic mean field games for which the state space is a network. In the ergodic case, they are described by a system coupling a Hamilton-Jacobi-Bellman equation and a Fokker-Planck equation, whose unknowns are the invariant…
Optimal behavior in (competitive) situation is traditionally determined with the help of utility functions that measure the payoff of different actions. Given an ordering on the space of revenues (payoffs), the classical axiomatic approach…
Recent advancements in vehicle autonomy have drawn interest in understanding the impact of autonomous vehicles on traffic systems. In this paper, we study a traffic assignment problem in a mixed-autonomy setting where both human-driven and…
This paper is concerned with games of infinite duration played over potentially infinite graphs. Recently, Ohlmann (LICS 2022) presented a characterisation of objectives admitting optimal positional strategies, by means of universal graphs:…
A hypergraph is a generalization of an ordinary graph, and it naturally represents group interactions as hyperedges (i.e., arbitrary-sized subsets of nodes). Such group interactions are ubiquitous in many domains: the sender and receivers…
Given a large number of homogeneous players that are distributed across three possible states, we consider the problem in which these players have to control their transition rates, while minimizing a cost. The optimal transition rates are…
We develop value iteration-based algorithms to solve in a unified manner different classes of combinatorial zero-sum games with mean-payoff type rewards. These algorithms rely on an oracle, evaluating the dynamic programming operator up to…
We consider N-player and mean field games in continuous time over a finite horizon, where the position of each agent belongs to {-1,1}. If there is uniqueness of mean field game solutions, e.g. under monotonicity assumptions, then the…
We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes…
We investigate concurrent two-player win/lose stochastic games on finite graphs with prefix-independent objectives. We characterize subgame optimal strategies and use this characterization to show various memory transfer results: 1) For a…
We consider fair allocation of indivisible items under an additional constraint: there is an undirected graph describing the relationship between the items, and each agent's share must form a connected subgraph of this graph. This framework…
Even though power-law or close-to-power-law degree distributions are ubiquitously observed in a great variety of large real networks, the mathematically satisfactory treatment of random power-law graphs satisfying basic statistical…
Evolutionary games on graphs play an important role in the study of evolution of cooperation in applied biology. Using rigorous mathematical concepts from a dynamical systems and graph theoretical point of view, we formalize the notions of…
We study online combinatorial allocation problems in the secretary setting, under interdependent values. In the interdependent model, introduced by Milgrom and Weber (1982), each agent possesses a private signal that captures her…
We consider the problem of designing network cost-sharing protocols with good equilibria under uncertainty. The underlying game is a multicast game in a rooted undirected graph with nonnegative edge costs. A set of k terminal vertices or…
Classical game-theoretic models typically assume rational agents, complete information, and common knowledge of payoffs - assumptions that are often violated in real-world MAS characterized by uncertainty, misaligned perceptions, and nested…
To build agents that can collaborate effectively with others, recent research has trained artificial agents to communicate with each other in Lewis-style referential games. However, this often leads to successful but uninterpretable…
This paper establishes a complete theoretical foundation for the Hodge-theoretic extension of the Shapley value introduced by Stern and Tettenhorst (2019). We show that a set of five axioms--efficiency, linearity, symmetry, a modified…