Learning equilibria in matching markets from bandit feedback
Large-scale, two-sided matching platforms must find market outcomes that align with user
preferences while simultaneously learning these preferences from data. But since …
preferences while simultaneously learning these preferences from data. But since …
Stable matching mechanisms are not obviously strategy-proof
Many two-sided matching markets, from labor markets to school choice programs, use a
clearinghouse based on the applicant-proposing deferred acceptance algorithm, which is …
clearinghouse based on the applicant-proposing deferred acceptance algorithm, which is …
Information acquisition in matching markets: The role of price discovery
We explore the acquisition and flow of information in matching markets through a model of
college admissions with endogenous costly information acquisition. We extend the notion of …
college admissions with endogenous costly information acquisition. We extend the notion of …
A stable marriage requires communication
In 1976, Knuth asked whether the worst-case running-time of the Gale-Shapley algorithm for
the Stable Marriage Problem can be improved when non-sequential access to the input is …
the Stable Marriage Problem can be improved when non-sequential access to the input is …
Multi-user lax communications: a multi-armed bandit approach
Inspired by cognitive radio networks, we consider a setting where multiple users share
several channels modeled as a multi-user multi-armed bandit (MAB) problem. The …
several channels modeled as a multi-user multi-armed bandit (MAB) problem. The …
Clearing matching markets efficiently: informative signals and match recommendations
We study how to reduce congestion in two-sided matching markets with private preferences.
We measure congestion by the number of bits of information that agents must (i) learn about …
We measure congestion by the number of bits of information that agents must (i) learn about …
Designing approximately optimal search on matching platforms
We study the design of a decentralized two-sided matching market in which agents' search
is guided by the platform. Each agent is of one of finitely many types and has (potentially …
is guided by the platform. Each agent is of one of finitely many types and has (potentially …
[HTML][HTML] Energy-efficient task offloading in fog computing for 5G cellular network
The proliferation of IoT devices has introduced challenges, including high delay, increased
energy consumption, and heavy load. This paper proposes a new energy-aware task …
energy consumption, and heavy load. This paper proposes a new energy-aware task …
Multi-user communication networks: A coordinated multi-armed bandit approach
Communication networks shared by many users are a widespread challenge nowadays. In
this paper we address several aspects of this challenge simultaneously: learning unknown …
this paper we address several aspects of this challenge simultaneously: learning unknown …
Online to offline business: urban taxi dispatching with passenger-driver matching stability
In the Online to Offline (O2O) taxi business (eg, Uber), the interests of passengers, taxi
drivers, and the company may not align with one another, since taxis do not belong to the …
drivers, and the company may not align with one another, since taxis do not belong to the …