English
Related papers

Related papers: Computational Aspects of Private Bayesian Persuasi…

200 papers

A principal who values an object allocates it to one or more agents. Agents learn private information (signals) from an information designer about the allocation payoff to the principal. Monetary transfer is not available but the principal…

Theoretical Economics · Economics 2022-10-31 Yi-Chun Chen , Gaoji Hu , Xiangqian Yang

Social marketing is becoming increasingly important in contemporary business. Central to social marketing is quantifying how consumers choose between alternatives and how they influence each other. This work considers a new but simple…

Social and Information Networks · Computer Science 2014-05-05 Jeremy Chen

We introduce the study of sequential information elicitation in strategic multi-agent systems. In an information elicitation setup a center attempts to compute the value of a function based on private information (a-k-a secrets) accessible…

Computer Science and Game Theory · Computer Science 2012-07-19 Rann Smorodinsky , Moshe Tennenholtz

An analyst observes the frequency with which an agent takes actions, but not the frequency with which she takes actions conditional on a payoff relevant state. In this setting, we ask when the analyst can rationalize the agent's choices as…

Theoretical Economics · Economics 2023-07-27 Laura Doval , Ran Eilat

We consider a variant of the standard Bayesian mechanism, where players evaluate their outcomes and constraints in an ex-ante manner. Such a model captures a major form of modern online advertising where an advertiser is concerned with…

Computer Science and Game Theory · Computer Science 2022-03-01 Bonan Ni , Pingzhong Tang

This paper considers the hidden-action model of the principal-agent problem, in which a principal incentivizes an agent to work on a project using a contract. We investigate whether contracts with bounded payments are learnable and…

Computer Science and Game Theory · Computer Science 2024-02-23 Yurong Chen , Zhaohua Chen , Xiaotie Deng , Zhiyi Huang

The Probabilistic Serial mechanism is well-known for its desirable fairness and efficiency properties. It is one of the most prominent protocols for the random assignment problem. However, Probabilistic Serial is not incentive-compatible,…

Computer Science and Game Theory · Computer Science 2020-01-30 Zihe Wang , Zhide Wei , Jie Zhang

A principal delegates choice to an agent whose decision depends on both beliefs and tastes. The principal can steer the delegated decision using two costly instruments: (i) an information policy that determines a Bayes--plausible…

Theoretical Economics · Economics 2026-02-12 Kemal Ozbek

Modern ad auctions allow advertisers to target more specific segments of the user population. Unfortunately, this is not always in the best interest of the ad platform. In this paper, we examine the following basic question in the context…

Computer Science and Game Theory · Computer Science 2019-07-16 Ashwinkumar Badanidiyuru , Kshipra Bhawalkar , Haifeng Xu

We study continuous-time persuasion where a sender controls both how informative a signal is over time and when to stop providing information to a receiver. Given an exogenous signal process, the sender can both garble the evolving signal…

Theoretical Economics · Economics 2025-12-19 Can Urgun , Mark Whitmeyer

As one of the classic models that describe the belief dynamics over social networks, a non-Bayesian social learning model assumes that members in the network possess accurate signal knowledge through the process of Bayesian inference. In…

Social and Information Networks · Computer Science 2019-05-21 Sannyuya Liu , Zhonghua Yan , Xiufeng Cheng , Liang Zhao

We study a dynamic Bayesian persuasion model called Markovian persuasion. In such a model, the belief of the receiver regarding the current state of a Markov chain $(X_n)_{n\geq 1}$, over a finite state space $K$, is controlled through…

Optimization and Control · Mathematics 2025-12-09 Dimitry Shaiderman

Consider a Bayesian binary decision-making problem in star networks, where local agents make selfish decisions independently, and a fusion agent makes a final decision based on aggregated decisions and its own private signal. In particular,…

Information Theory · Computer Science 2021-10-27 Daewon Seo , Ravi Kiran Raman , Lav R. Varshney

This paper focuses on managing the cost of deliberation before action. In many problems, the overall quality of the solution reflects costs incurred and resources consumed in deliberation as well as the cost and benefit of execution, when…

Artificial Intelligence · Computer Science 2013-04-05 David Einav , Michael R. Fehling

In this paper we revisit the basic variant of the classical secretary problem. We propose a new approach in which we separate between an agent that evaluates the secretary performance and one that has to make the hiring decision. The…

Computer Science and Game Theory · Computer Science 2020-05-27 Niklas Hahn , Martin Hoefer , Rann Smorodinsky

We consider a finite-horizon discrete-time dynamic system jointly controlled by a designer and one or more agents, where the designer can influence the agents' actions through selective information disclosure. At each time step, the…

Systems and Control · Electrical Eng. & Systems 2025-08-04 Renyan Sun , Ashutosh Nayyar

Classical Bayesian persuasion assumes that senders fully understand how receivers form beliefs and make decisions--an assumption that rarely holds when receivers possess private information or exhibit non-Bayesian behavior. In this paper,…

Systems and Control · Electrical Eng. & Systems 2025-11-11 Heeseung Bang , Andreas A. Malikopoulos

We study a model of persuasion in which the receiver is a `conservative Bayesian' whose updated belief is a convex combination of the prior and the correct Bayesian posterior. While in the classic Bayesian case providing information…

Theoretical Economics · Economics 2025-08-14 Yaron Azrieli , Rachana Das

It is challenging to quantify numerical preferences for different objectives in a multi-objective decision-making problem. However, the demonstrations of a user are often accessible. We propose an algorithm to infer linear preference…

Artificial Intelligence · Computer Science 2023-04-28 Junlin Lu

We show that computing the revenue-optimal deterministic auction in unit-demand single-buyer Bayesian settings, i.e. the optimal item-pricing, is computationally hard even in single-item settings where the buyer's value distribution is a…

Computer Science and Game Theory · Computer Science 2015-03-10 Constantinos Daskalakis , Alan Deckelbaum , Christos Tzamos