English
Related papers

Related papers: Regret-Minimizing Bayesian Persuasion

200 papers

We consider an adversarial Bayesian signal processing problem involving "us" and an "adversary". The adversary observes our state in noise; updates its posterior distribution of the state and then chooses an action based on this posterior.…

Signal Processing · Electrical Eng. & Systems 2020-02-19 Vikram Krishnamurthy , Muralidhar Rangaswamy

In this paper, we study axiomatic foundations of Bayesian persuasion, where a principal (i.e., sender) delegates the task of choice making after informing a biased agent (i.e., receiver) about the payoff relevant uncertain state (see, e.g.,…

Theoretical Economics · Economics 2025-12-30 Youichiro Higashi , Kemal Ozbek , Norio Takeoka

We study the use of Bayesian persuasion (i.e., strategic use of information disclosure/signaling) in endogenous team formation. This is an important consideration in settings such as crowdsourcing competitions, open science challenges and…

Computer Science and Game Theory · Computer Science 2019-10-03 Chamsi Hssaine , Siddhartha Banerjee

We study the problem of designing optical receivers to discriminate between multiple coherent states using coherent processing receivers---i.e., one that uses arbitrary coherent feedback control and quantum-noise-limited direct…

Quantum Physics · Physics 2017-07-26 Hye Won Chung , Saikat Guha , Lizhong Zheng

A sensing policy for the restless multi-armed bandit problem with stationary but unknown reward distributions is proposed. The work is presented in the context of cognitive radios in which the bandit problem arises when deciding which parts…

Information Theory · Computer Science 2012-11-20 Jan Oksanen , Visa Koivunen , H. Vincent Poor

Transformers have demonstrated exceptional performance across a wide range of domains. While their ability to perform reinforcement learning in-context has been established both theoretically and empirically, their behavior in…

Machine Learning · Statistics 2025-10-24 Baiyuan Chen , Shinji Ito , Masaaki Imaizumi

Boosting is a widely used machine learning approach based on the idea of aggregating weak learning rules. While in statistical learning numerous boosting methods exist both in the realizable and agnostic settings, in online learning they…

Machine Learning · Computer Science 2020-03-04 Nataly Brukhim , Xinyi Chen , Elad Hazan , Shay Moran

We study the problem of worst case regret in piecewise stationary multi armed bandits. While the minimax theory for stationary bandits is well established, understanding analogous limits in time-varying settings is challenging. Existing…

Machine Learning · Computer Science 2025-11-11 Gal Mendelson , Eyal Tadmor

An important use of machine learning is to learn what people value. What posts or photos should a user be shown? Which jobs or activities would a person find rewarding? In each case, observations of people's past choices can inform our…

Artificial Intelligence · Computer Science 2015-12-21 Owain Evans , Andreas Stuhlmueller , Noah D. Goodman

As artificial agents become increasingly capable, what internal structure is *necessary* for an agent to act competently under uncertainty? Classical results show that optimal control can be *implemented* using belief states or world…

Machine Learning · Computer Science 2026-04-03 Aran Nayebi

In the latent bandit problem, the learner has access to reward distributions and -- for the non-stationary variant -- transition models of the environment. The reward distributions are conditioned on the arm and unknown latent states. The…

Machine Learning · Computer Science 2022-07-11 Alexander Galozy , Slawomir Nowaczyk

In many real-world scenarios, experts must convey complex information with limited message capacity. This paper explores how the availability of messages influences an expert's persuasive ability. We develop a geometric representation of…

Theoretical Economics · Economics 2024-05-09 Yunus C. Aybas , Eray Turkel

We study episodic linear mixture MDPs with the unknown transition and adversarial rewards under full-information feedback, employing dynamic regret as the performance measure. We start with in-depth analyses of the strengths and limitations…

Machine Learning · Computer Science 2024-11-06 Long-Fei Li , Peng Zhao , Zhi-Hua Zhou

We develop a new framework for designing online policies given access to an oracle providing statistical information about an offline benchmark. Having access to such prediction oracles enables simple and natural Bayesian selection…

Data Structures and Algorithms · Computer Science 2020-02-28 Alberto Vera , Siddhartha Banerjee

Performance of adaptive control policies is assessed through the regret with respect to the optimal regulator, which reflects the increase in the operating cost due to uncertainty about the dynamics parameters. However, available results in…

Systems and Control · Computer Science 2020-03-24 Mohamad Kazem Shirani Faradonbeh , Ambuj Tewari , George Michailidis

We consider a safe optimization problem with bandit feedback in which an agent sequentially chooses actions and observes responses from the environment, with the goal of maximizing an arbitrary function of the response while respecting…

Machine Learning · Computer Science 2023-05-02 Spencer Hutchinson , Berkay Turan , Mahnoosh Alizadeh

Cheng (2025) establishes that in a persuasion game where both the sender and the receiver have Maxmin Expected Utility (MEU) preferences, the sender never strictly benefits from using ambiguous communication strategies over standard…

Theoretical Economics · Economics 2025-08-27 Xiaoyu Cheng

The dynamics of adoption of innovations is an important subject in many fields and areas, like technological development, industrial processes, social behavior, fashion or marketing. The number of adopters of a new technology generally…

Physics and Society · Physics 2017-06-28 Mirta B. Gordon , M. F. Laguna , S. Goncalves , J. R. Iglesias

We consider a long-term average profit maximizing admission control problem in an M/M/1 queuing system with unknown service and arrival rates. With a fixed reward collected upon service completion and a cost per unit of time enforced on…

Optimization and Control · Mathematics 2023-11-27 Asaf Cohen , Vijay G. Subramanian , Yili Zhang

We study Bayesian learning in episodic, finite-horizon zero-sum Markov games with unknown transition and reward models. We investigate a posterior algorithm in which each player maintains a Bayesian posterior over the game model,…

Machine Learning · Computer Science 2026-03-24 Chang-Wei Yueh , Andy Zhao , Ashutosh Nayyar , Rahul Jain
‹ Prev 1 8 9 10 Next ›