相关论文: Phase transition in the Kolkata Paise Restaurant p…

This paper studies how groups of robots can effectively navigate through a crowd of agents. It quantifies the performance of platooning and less constrained, greedy strategies, and the extent to which these strategies disrupt the crowd…

The changes in user preferences can originate from substantial reasons, like personality shift, or transient and circumstantial ones, like seasonal changes in item popularities. Disregarding these temporal drifts in modelling user…

Indoor venues accommodate many people who collectively form crowds. Such crowds in turn influence people's routing choices, e.g., people may prefer to avoid crowded rooms when walking from A to B. This paper studies two types of crowd-aware…

We consider a discrete population of users with homogeneous service demand who need to decide when to arrive to a system in which the service rate deteriorates linearly with the number of users in the system. The users have heterogeneous…

We show that in a variant of the Minority Game problem, the agents can reach a state of maximum social efficiency, where the fluctuation between the two choices is minimum, by following a simple stochastic strategy. By imagining a social…

Patient-to-room assignment (PRA) is a scheduling problem in decision support for hospitals. It consists of assigning patients to rooms according to certain objectives, e.g., avoiding transfers and respecting single-room requests. This work…

Recommendation systems are pervasive in the digital economy. An important assumption in many deployed systems is that user consumption reflects user preferences in a static sense: users consume the content they like with no other…

We consider the problem of learning to behave optimally in a Markov Decision Process when a reward function is not specified, but instead we have access to a set of demonstrators of varying performance. We assume the demonstrators are…

Many dynamical systems operate in a fluctuating environment. However, even in low-dimensional setups, transitions and bifurcations have not yet been fully understood. In this Letter we focus on crises, a sudden flooding of the phase space…

We study a distributed facility location problem in which a set of agents, each with a private position on the real line, is partitioned into a collection of fixed, disjoint groups. The goal is to open $k$ facilities at locations chosen…

We consider a fair resource allocation problem in the no-regret setting against an unrestricted adversary. The objective is to allocate resources equitably among several agents in an online fashion so that the difference of the aggregate…

In an emergency situation, imitation of strategies of neighbours can lead to an order-disorder phase transition, where spatial clusters of pedestrians adopt the same strategy. We assume that there are two strategies, cooperating and…

We study a learning model in which an agent is stationed at each vertex of $\mathbb{T}_{m}$, the rooted tree in which each vertex has $m$ children. At any time-step $t \in \mathbb{N}_{0}$, they are allowed to select one of two available…

We present numerical results on a complex dynamical model for the aggregation of many individual rankings of S alternatives by the pairwise majority rule under a deliberative scenario. Agents are assumed to interact when the Kemeny distance…

The prisoner's dilemma (PD) is a game-theoretic model studied in a wide array of fields to understand the emergence of cooperation between rational self-interested agents. In this work, we formulate a spatial iterated PD as a discrete-event…

Motivated by practical federated learning settings where clients may not be always available, we investigate a variant of distributed online optimization where agents are active with a known probability $p$ at each time step, and…

Stackelberg routing platforms (SRP) reduce congestion in one-shot traffic networks by proposing optimal route recommendations to selfish travelers. Traditionally, Stackelberg routing is cast as a partial control problem where a fraction of…

Consider a multi-class preemptive-resume $M/D/1$ queueing system that supports advance reservations (AR). In this system, strategic customers must decide whether to reserve a server in advance (thereby gaining higher priority) or avoid AR.…

We study the problem of preserving privacy while still providing high utility in sequential decision making scenarios in a changing environment. We consider abruptly changing environment: the environment remains constant during periods and…

We study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each pair of agents can yield a different match value, and…