A survey of papers on practically significant restrictions on the preference profile of a
collective is carried out, including single-peaked preferences, group-separable preferences …

We study a Markov matching market involving a planner and a set of strategic agents on the
two sides of the market. At each step, the agents are presented with a dynamical context …

Large-scale, two-sided matching platforms must find market outcomes that align with user
preferences while simultaneously learning these preferences from data. But since …

We study the problem of decision-making in the setting of a scarcity of shared resources
when the preferences of agents are unknown a priori and must be learned from data. Taking …

Motivated by packet routing in computer networks, online queuing systems are composed of
queues receiving packets at different rates. Repeatedly, they send packets to servers, each …

In this paper, we consider the matching of multi-agent multi-armed bandit problem, ie, while
agents prefer arms with higher expected reward, arms also have preferences on agents. In …

Competitions for shareable and limited resources have long been studied with strategic
agents. In reality, agents often have to learn and maximize the rewards of the resources at …

The problem of two-sided matching markets has a wide range of real-world applications and
has been extensively studied in the literature. A line of recent works have focused on the …

The problem of matching markets has been studied for a long time in the literature due to its
wide range of applications. Finding a stable matching is a common equilibrium objective in …

Two-sided matching markets have been widely studied in the literature due to their rich
applications. Since participants are usually uncertain about their preferences, online …