English
Related papers

Related papers: Exploration and Incentivizing Participation in Ran…

200 papers

In the incentivized exploration model, a principal aims to explore and learn over time by interacting with a sequence of self-interested agents. It has been recently understood that the main challenge in designing incentive-compatible…

Computer Science and Game Theory · Computer Science 2025-06-03 Benjamin Schiffer , Mark Sellke

We discuss the relative merits of optimistic and randomized approaches to exploration in reinforcement learning. Optimistic approaches presented in the literature apply an optimistic boost to the value estimate at each state-action pair and…

Machine Learning · Statistics 2017-06-15 Ian Osband , Benjamin Van Roy

We consider a two-road dynamic routing game where the state of one of the roads (the "risky road") is stochastic and may change over time. This generates room for experimentation. A central planner may wish to induce some of the (finite…

Computer Science and Game Theory · Computer Science 2020-01-13 Emily Meigs , Francesca Parise , Asuman Ozdaglar , Daron Acemoglu

We consider the problem of incentivising desirable behaviours in multi-agent systems by way of taxation schemes. Our study employs the concurrent games model: in this model, each agent is primarily motivated to seek the satisfaction of a…

Computer Science and Game Theory · Computer Science 2023-07-12 David Hyland , Julian Gutierrez , Michael Wooldridge

Randomized controlled trials (RCTs) face inherent limitations, such as ethical or resource constraints, which lead to a limited number of study participants. To address these limitations, recent research endeavors have sought to incorporate…

Methodology · Statistics 2025-02-20 Peijin Wang , Hwanhee Hong , Kyungeun Jeon , Laine Elliott Thomas

We investigate the possibility of an incentive-compatible (IC, a.k.a. strategy-proof) mechanism for the classification of agents in a network according to their reviews of each other. In the $ \alpha $-classification problem we are…

Computer Science and Game Theory · Computer Science 2019-11-21 Yakov Babichenko , Oren Dean , Moshe Tennenholtz

Randomized controlled trials (RCTs) often suffer from limited sample sizes due to high costs and lengthy recruitment periods, compromising precision in treatment effect estimation. External real-world control data offer a valuable…

Applications · Statistics 2026-05-05 Peng Wu , Jile Chaoge , Shu Yang

Observed events in recommendation are consequence of the decisions made by a policy, thus they are usually selectively labeled, namely the data are Missing Not At Random (MNAR), which often causes large bias to the estimate of true outcomes…

Machine Learning · Computer Science 2021-10-05 Zifeng Wang , Xi Chen , Rui Wen , Shao-Lun Huang

Designing protocols enhancing cooperation for multi-agent systems remains a grand challenge. Cheap talk, defined as costless, non-binding communication before formal action, serves as a pivotal solution. However, existing theoretical…

Multiagent Systems · Computer Science 2026-03-03 Zhao Song , Chen Shen , Zhen Wang , The Anh Han

Despite their cost, randomized controlled trials (RCTs) are widely regarded as gold-standard evidence in disciplines ranging from social science to medicine. In recent decades, researchers have increasingly sought to reduce the resource…

Methodology · Statistics 2026-02-24 Guilherme Duarte

Randomized controlled trials (RCTs) are the gold standard for evaluating the causal effect of a treatment; however, they often have limited sample sizes and sometimes poor generalizability. On the other hand, non-randomized, observational…

Methodology · Statistics 2021-09-23 Shuxiao Chen , Bo Zhang , Ting Ye

Reinforcement Learning (RL) is known to be often unsuccessful in environments with sparse extrinsic rewards. A possible countermeasure is to endow RL agents with an intrinsic reward function, or 'intrinsic motivation', which rewards the…

Artificial Intelligence · Computer Science 2021-07-16 Francesco Massari , Martin Biehl , Lisa Meeden , Ryota Kanai

The multi-agent setting is intricate and unpredictable since the behaviors of multiple agents influence one another. To address this environmental uncertainty, distributional reinforcement learning algorithms that incorporate uncertainty…

Machine Learning · Computer Science 2023-03-06 Jihwan Oh , Joonkee Kim , Minchan Jeong , Se-Young Yun

We consider a setting where goods are allocated to agents by way of an allocation platform (e.g., a matching platform). An ``allocation facilitator'' aims to increase the overall utility/social-good of the allocation by encouraging (some of…

Computer Science and Game Theory · Computer Science 2025-08-27 Yohai Trabelsi , Abhijin Adiga , Yonatan Aumann , Sarit Kraus , S. S. Ravi

Observational studies provide the only evidence on the effectiveness of interventions when randomized controlled trials (RCTs) are impractical due to cost, ethical concerns, or time constraints. While many methodologies aim to draw causal…

Across research disciplines, cluster randomized trials (CRTs) are commonly implemented to evaluate interventions delivered to groups of participants, such as communities and clinics. Despite advances in the design and analysis of CRTs,…

Machine learning is increasingly used to select which individuals receive limited-resource interventions in domains such as human services, education, development, and more. However, it is often not apparent what the right quantity is for…

Machine Learning · Computer Science 2025-03-20 Vibhhu Sharma , Bryan Wilder

Experiments on online marketplaces and social networks suffer from interference, where the outcome of a unit is impacted by the treatment status of other units. We propose a framework for modeling interference using a ubiquitous deployment…

Methodology · Statistics 2023-08-21 Ariel Boyarsky , Hongseok Namkoong , Jean Pouget-Abadie

In this paper, we consider a general distributed system with multiple agents who select and then implement actions in the system. The system has an operator with a centralized objective. The agents, on the other hand, are selfinterested and…

Computer Science and Game Theory · Computer Science 2020-01-15 Donya Ghavidel , Pratyush Chakraborty , Enrique Baeyens , Vijay Gupta , Pramod P. Khargonekar

We study the design of effort-maximizing grading schemes between agents with private abilities. Assuming agents derive value from the information their grade reveals about their ability, we find that more informative grading schemes induce…

Computer Science and Game Theory · Computer Science 2024-11-11 Sumit Goel