English
Related papers

Related papers: Learning Equilibria in Matching Markets from Bandi…

200 papers

Contextual bandits are a form of multi-armed bandit in which the agent has access to predictive side information (known as the context) for each arm at each time step, and have been used to model personalized news recommendation, ad…

Machine Learning · Statistics 2017-05-25 Aniket Anand Deshmukh , Urun Dogan , Clayton Scott

In this work, we study a generalized Fisher market model that incorporates social influence. In this extended model, a buyer's utility depends not only on their own resource allocation but also on the allocations received by their…

Computer Science and Game Theory · Computer Science 2025-01-14 Mandar Datar

Motivated by online advertising auctions, we consider repeated Vickrey auctions where goods of unknown value are sold sequentially and bidders only learn (potentially noisy) information about a good's value once it is purchased. We adopt an…

Computer Science and Game Theory · Computer Science 2015-11-19 Jonathan Weed , Vianney Perchet , Philippe Rigollet

Stochastic dominance serves as a general framework for modeling a broad spectrum of decision preferences under uncertainty, with risk aversion as one notable example, as it naturally captures the intrinsic structure of the underlying…

Machine Learning · Computer Science 2026-01-06 Shicong Cen , Jincheng Mei , Hanjun Dai , Dale Schuurmans , Yuejie Chi , Bo Dai

We study dynamic decentralized two-sided matching in which players may encounter unanticipated experiences. As they become aware of these experiences, they may change their preferences over players on the other side of the market.…

Theoretical Economics · Economics 2025-05-14 Burkhard C. Schipper , Tina Danting Zhang

Many-to-many matching with contracts is studied in the framework of revealed preferences. All preferences are described by choice functions that satisfy natural conditions. Under a no-externality assumption individual preferences can be…

Computer Science and Game Theory · Computer Science 2020-03-05 Daniel Lehmann

We develop a flexible stochastic approximation framework for analyzing the long-run behavior of learning in games (both continuous and finite). The proposed analysis template incorporates a wide array of popular learning algorithms,…

Computer Science and Game Theory · Computer Science 2023-07-04 Panayotis Mertikopoulos , Ya-Ping Hsieh , Volkan Cevher

We study supervisory switching control for partially-observed linear dynamical systems. The objective is to identify and deploy the best controller for the unknown system by periodically selecting among a collection of $N$ candidate…

Optimization and Control · Mathematics 2026-03-19 Haoyuan Sun , Ali Jadbabaie

Traditional bulk load flexibility options, such as load shifting and load curtailment, for managing uncertainty in power markets limit the diversity of options and ignore the preferences of the individual loads, thus reducing efficiency and…

Systems and Control · Electrical Eng. & Systems 2021-12-20 Majid Majidi , Deepan Muthirayan , Masood Parvania , Pramod P. Khargonekar

Sequential fundraising in two sided online platforms enable peer to peer lending by sequentially bringing potential contributors, each of whose decisions impact other contributors in the market. However, understanding the dynamics of…

Machine Learning · Computer Science 2023-08-03 Soumajyoti Sarkar

Most online platforms strive to learn from interactions with users, and many engage in exploration: making potentially suboptimal choices for the sake of acquiring new information. We study the interplay between exploration and competition:…

Computer Science and Game Theory · Computer Science 2024-10-15 Guy Aridor , Yishay Mansour , Aleksandrs Slivkins , Zhiwei Steven Wu

We consider active learning under incentive compatibility constraints. The main application of our results is to economic experiments, in which a learner seeks to infer the parameters of a subject's preferences: for example their attitudes…

Computer Science and Game Theory · Computer Science 2019-11-15 Federico Echenique , Siddharth Prasad

Bandit based optimisation has a remarkable advantage over gradient based approaches due to their global perspective, which eliminates the danger of getting stuck at local optima. However, for continuous optimisation problems or problems…

Artificial Intelligence · Computer Science 2017-05-30 Ole-Christoffer Granmo

We consider a large class of social learning models in which a group of agents face uncertainty regarding a state of the world, share the same utility function, observe private signals, and interact in a general dynamic setting. We…

Statistics Theory · Mathematics 2020-05-14 Elchanan Mossel , Manuel Mueller-Frank , Allan Sly , Omer Tamuz

Contextual bandit algorithms are sensitive to the estimation method of the outcome model as well as the exploration method used, particularly in the presence of rich heterogeneity or complex outcome models, which can lead to difficult…

Machine Learning · Statistics 2018-12-18 Maria Dimakopoulou , Zhengyuan Zhou , Susan Athey , Guido Imbens

The multi-armed bandit problem is a classical decision-making problem where an agent has to learn an optimal action balancing exploration and exploitation. Properly managing this trade-off requires a correct assessment of uncertainty; in…

Machine Learning · Computer Science 2020-08-18 Fabio Massimo Zennaro , Audun Jøsang

Matching markets are often organized in a multi-stage and decentralized manner. Moreover, participants in real-world matching markets often have uncertain preferences. This article develops a framework for learning optimal strategies in…

Computer Science and Game Theory · Computer Science 2021-12-21 Xiaowu Dai , Michael I. Jordan

This paper studies matching markets where institutions are matched with possibly more than one individual. The matching market contains some couples who view the pair of jobs as complements. First, we show by means of an example that a…

Theoretical Economics · Economics 2025-07-11 Shashwat Khare , Souvik Roy , Ton Storcken

The safe linear bandit problem is a version of the classical stochastic linear bandit problem where the learner's actions must satisfy an uncertain constraint at all rounds. Due its applicability to many real-world settings, this problem…

Machine Learning · Computer Science 2024-03-13 Spencer Hutchinson , Berkay Turan , Mahnoosh Alizadeh

A contextual bandit problem is studied in a highly non-stationary environment, which is ubiquitous in various recommender systems due to the time-varying interests of users. Two models with disjoint and hybrid payoffs are considered to…

Machine Learning · Computer Science 2020-03-03 Xiao Xu , Fang Dong , Yanghua Li , Shaojian He , Xin Li
‹ Prev 1 4 5 6 7 8 10 Next ›