Corpus ID: 235621493

Multi-agent Assortment Optimization in Sequential Matching Markets

  title={Multi-agent Assortment Optimization in Sequential Matching Markets},
  author={Alfredo Torrico and Margarida Carvalho and Andrea Lodi},
Two-sided markets have become increasingly more important during the last years, mostly because of their numerous applications in housing, labor and dating. Consumer-supplier matching platforms pose several technical challenges, specially due to the tradeoff between recommending suitable suppliers to consumers and avoiding collisions among consumers’ preferences. In this work, we study a general version of the two-sided sequential matching model introduced by Ashlagi et al. (2019). The setting… Expand

Figures and Tables from this paper


Assortment planning for two-sided sequential matching markets
An efficient algorithm is provided that achieves a constant-factor approximation to the expected number of matches in two-sided matching platforms that is shown to be strongly NP-hard via a reduction from 3-partition. Expand
Two-sided matching with partial information
The traditional model of two-sided matching assumes that all agents fully know their own preferences. As markets grow large, however, it becomes impractical for agents to precisely assess theirExpand
Capacity Constrained Assortment Optimization Under the Markov Chain Based Choice Model
Assortment optimization is an important problem that arises in many practical applications such as retailing and online advertising. In such settings, the goal is to select a subset of items to offerExpand
Facilitating the Search for Partners on Matching Platforms: Restricting Agent Actions
It is found that in many settings, the platform can mitigate wasteful competition in partner search via restricting what agents can see/do, and further boost welfare by hiding quality information. Expand
Managing Congestion in Matching Markets
Participants in matching markets face search and screening costs which prevent the market from clearing efficiently. In many settings, the rise of online matching platforms has dramatically reducedExpand
A markov chain approximation to choice modeling
Assortment planning is an important problem that arises in many industries such as retailing and airlines. One of the key challenges in an assortment planning problem is to identify the "right model"Expand
Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters
We consider assortment optimization problems under the multinomial logit model, where the parameters of the choice model are random. The randomness in the choice model parameters is motivated by theExpand
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
This work develops an adaptive policy that learns the unknown parameters from past data and at the same time optimizes the profit and develops a simple algorithm for computing a profit-maximizing assortment based on the geometry of lines in the plane. Expand
A Column Generation Algorithm for Choice-Based Network Revenue Management
To solve the CDLP for real-size networks, it is proved that the associated column generation subproblem is indeed NP-hard and a simple, greedy heuristic is proposed to overcome the complexity of an exact algorithm. Expand
Capacitated Assortment Optimization: Hardness and Approximation
Assortment optimization is an important problem that arises in many practical applications such as retailing and online advertising. In this problem, the goal is to select a subset of items thatExpand