Persuading Farsighted Receivers in MDPs: the Power of Honesty

Bayesian persuasion studies the problem faced by an informed sender who strategically discloses information to influence the behavior of an uninformed receiver. Recently, a growing attention has been devoted to settings where the sender and the receiver interact sequentially, in which the receiver's decision-making problem is usually modeled as a Markov decision process (MDP). However, previous works focused on computing optimal information-revelation policies (a.k.a. signaling schemes) under the restrictive assumption that the receiver acts myopically, selecting actions to maximize the one-step utility and disregarding future rewards. This is justified by the fact that, when the receiver is farsighted and thus considers future rewards, finding an optimal Markovian signaling scheme is NP-hard. In this paper, we show that Markovian signaling schemes do not constitute the"right"class of policies. Indeed, differently from most of the MDPs settings, we prove that Markovian signaling schemes are not optimal, and general history-dependent signaling schemes should be considered. Moreover, we also show that history-dependent signaling schemes circumvent the negative complexity results affecting Markovian signaling schemes. Formally, we design an algorithm that computes an optimal and {\epsilon}-persuasive history-dependent signaling scheme in time polynomial in 1/{\epsilon} and in the instance size. The crucial challenge is that general history-dependent signaling schemes cannot be represented in polynomial space. Nevertheless, we introduce a convenient subclass of history-dependent signaling schemes, called promise-form, which are as powerful as general history-dependent ones and efficiently representable. Intuitively, promise-form signaling schemes compactly encode histories in the form of honest promises on future receiver's rewards.

Paper

References (26)

Scroll for more · 14 remaining

Similar papers

Peer review

Reviewer XkbC5/10 · confidence 2/52023-07-05

Summary

This paper studied a Bayesian persuasion problem where the sender and receiver act sequentially. Below are two main changes in the new problem setting of this work: (1) The authors assume that the sender stops providing recommendations to the receiver if the receiver does not follow the recommendation. (2) Under this assumption, the authors also consider farsighted receivers as opposed to myopic receivers in previous works. In the new setting, the authors showed that the Markovian signaling schemes are not optimal (additionally, finding the optimal Markovian signaling scheme in the previous problem settings in NP-hard), and they instead introduced a new class of promise-form signaling schemes for the new problem setting. The authors also show that the promise-form signaling schemes can be found in polynomial time while guaranteeing the schemes satisfy \epsilon-persuasive property.

Strengths

1. Clearly listed all key theoretical findings under the assumption that the sender will 2. A novel class of promise-form signaling schemes is given with approximation algorithms that are relatively practical and can be completed in polynomial time

Weaknesses

1. Overall a difficult-to-read paper (more difficult than the popular papers the authors cited) due to inadequate description and lack of concrete examples of the problem. Why sequential move in Bayesian persuasion is an important research topic is not highlighted. For a general audience not familiar with Bayesian persuasion, it is hard to tell why the new scenario is important. 2. Lack of justifications for the critical assumption that the sender will stop providing recommendations. Further justifications are needed to show that it is rational for the sender to prefer to stop recommending over other strategies commonly used like tit-for-tat, etc. If this is the typical case in real-world applications, the authors should also point out that to improve the soundness of this assumption. Since all findings in this paper are based on this assumption, I encourage the authors to put more emphasis on this. 3. Lack of discussion on the possible limitations

Questions

1. Can you please provide application scenarios that fit well the new case 2. Can you please add a discussion on the potential limitations 3. In all problems that involve strategic manipulations, the potential fairness issues 4. Why are numerical experiments included in some of the related works, e.g., "Bayesian Persuasion in Sequential Decision-Making" but not here in this paper? What are some of the major differences that result in the decision of skipping the numerical experiment part?

Rating

5: Borderline accept: Technically solid paper where reasons to accept outweigh reasons to reject, e.g., limited evaluation. Please use sparingly.

Confidence

2: You are willing to defend your assessment, but it is quite likely that you did not understand the central parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

2 fair

Contribution

2 fair

Limitations

Not that I can find due to my limited background in this topic.

Reviewer Rxqa8/10 · confidence 5/52023-07-07

Summary

The paper discusses a history-dependent signaling scheme in persuading a farsighted receiver. It first show that it is necessary for the sender to adopt a non-stationary and non-Markovian signaling scheme. Specifically, for every step and state reached at that step, this scheme defines a randomized mapping from the sender's private observations to action recommendations for the receiver, based on the whole history of states and receiver's actions observed up to that step. While such signaling policy could be intractable to describe, the paper provides a crucial simplification, promised-form signaling schemes, that allows the sender to only design finite size signaling scheme with optimal performance. Finally, the paper proposes a PTAS algorithm to determine the optimal promised-form signaling schemes.

Strengths

1. The paper is very well written! The authors clearly explain the motivation, the model, the results, and the proofs with vivid intuitions, making the technical concepts very easy to follow. 2. The paper extends the previous work on signaling schemes in MDPs to a more general setting, where the receiver is farsighted. The paper made several important technical and conceptual contributions to this problem, including the necessity of non-stationary and non-Markovian signaling schemes, the simplification to the promised-form signaling schemes, and the PTAS algorithm to determine the optimal promised-form signaling schemes.

Weaknesses

1. The method is related to the literature of dynamic stackelberg equilibrium. The authors should discuss the relationship between their methods. 2. I expect the authors to provide some real world applications of their model and methods, e.g., expand on the ride-sharing example in Appendix A.

Questions

How does the author think of the learning problem under this farsighted setup? Is it also possible to design a no-regret learning algorithm for the sender to learn the optimal promised-form signaling scheme?

Rating

8: Strong Accept: Technically strong paper, with novel ideas, excellent impact on at least one area, or high-to-excellent impact on multiple areas, with excellent evaluation, resources, and reproducibility, and no unaddressed ethical considerations.

Confidence

5: You are absolutely certain about your assessment. You are very familiar with the related work and checked the math/other details carefully.

Soundness

4 excellent

Presentation

4 excellent

Contribution

4 excellent

Limitations

n/a

Reviewer q53d7/10 · confidence 4/52023-07-13

Summary

This paper considers a specific model of information design, where the receiver takes actions on a sequential decision process under a global, unknown natural state $\theta$. To make the model simple, the work assumes that the sequential decision process to be an MDP with a known model, plus the ability of the receiver to exactly optimize the cumulative reward once a (belief of) $\theta$ is given. In this case, the signaling scheme represents a (more general) mapping from the natural state and the trajectory up to the current step to a distribution of actions as information revelation. Further, when making decisions the receiver is not allowed to use the posterior distribution/belief of the natural state obtained from previous steps (which means only $\hat\theta_h$ is used). Given the above assumptions in the model, the work provides a polynomial-time algorithm to obtain an $\epsilon$-persuasive signaling scheme. This disagrees with the NP-hard-like claims given in previous works. Such disagreement stems from the use of trajectory information and thereafter its simplified version of promise form. The algorithm is natural but quite creative.

Strengths

1. The work provides new models of information design in sequential decision problems. The new model no longer possesses theoretical hardness. 2. The work proposes a new polynomial-time algorithm to find an $\epsilon$-persuasive signaling scheme.

Weaknesses

Several limitations persist: 1) MDPs are assumed to be exactly solved. 2) MDP models are known 3) Receiver can't aggregate historical information of the natural state 4) No experiments.

Questions

This conclusion indeed applies to the model-based scenario (meaning that the receiver knows the state set $S$, the observation set $\Theta$, the state transition distribution $p$, and the observation distribution $\mu$). However, does this conclusion also apply to the model-free case? This question might not be within the scope of the work, but the conclusion drawn is a bit too broad if such estimation of model is now involved. If this situation is not discussed, the authors should emphasize this important assumption in the abstract and introduction. Specifically, it should be clarified which information the receiver is assumed to know and base their decisions on. This assumption represents a strong capability for the receiver. If it does not possess this knowledge, the sender's manipulation could be more powerful, and Markovian signaling schemes might be viable. For instance, if the receiver is unaware of the state and can only observe the sender's signals, and it needs to estimate the state and its transitions based on those signals, does the sender have the opportunity to confuse the receiver's judgments and achieve stronger persuasion? I find the claim "We consider the most general setting" in line 85 a bit too strong. Additionally, can the revelation principle argument still be applied in a sequential setting? Does recommending only one action for each state achieve the goal of persuading a receiver in an MDP? I could not find any relevant discussion on this. Has the author considered "future-dependent" signaling schemes: recommending a set of future actions for each state instead of just one action? Or sending a signal $m$ to encode a set of future actions they wish to recommend? Moreover, in the aforementioned scenario, can the sender confuse multiple states by sending signal $m$? If the revelation principle is abandoned, is a history-dependent signaling scheme still necessary? If there is no discussion on the validity of the revelation principle, this assumption should be prominently emphasized.

Rating

7: Accept: Technically solid paper, with high impact on at least one sub-area, or moderate-to-high impact on more than one areas, with good-to-excellent evaluation, resources, reproducibility, and no unaddressed ethical considerations.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

3 good

Presentation

3 good

Contribution

3 good

Limitations

See weakness

Reviewer bcaS6/10 · confidence 5/52023-07-19

Summary

The paper considers a (finite-horizon) dynamic persuasion problem between a sender and a receiver, both of whom are long-lived. At each time $t$, there is a publicly-observable state $s_t$ and a payoff-relevant quantity $\theta_t$, which is observed only by the sender, and whose distribution depends on the current state (and is independent of other quantities). Based on the observation of $\theta_t$ the sender recommends an action to the receiver (which may or may not be followed). The publicly-observable state then updates to $s_{t+1}$ according to a transition kernel that depends on the current state $s_t$, the quantity $\theta_t$ and the action chosen by the receiver. Both the sender and the receiver seek to maximize their total expected payoffs. Previous work on this topic, with few exceptions, has focused on myopic receivers, motivated by settings in which the receiver is short-lived. The difference here then is the focus on long-lived, far-sighted receiver. In this setting, the paper first shows (via an example) that the class of Markovian signaling schemes (whose recommendations only depend on the current state $s_t$) is insufficient for optimal persuasion, and the sender can do better using a signaling scheme that takes into account the history of the process. Due to the computational difficulties in working with general history-dependent schemes, the paper then considers promise-form signaling schemes, which make recommendations based not only on the current state, but also on a (history-dependent) "promise", which is a guarantee on the receiver's continuation payoffs. Essentially, the promise succinctly summarizes the history, thereby reducing the computational complexity to be polynomial in the size of set of promises. The authors show that, upon imposing a honesty condition on the promises across time, the class of promise-form signaling schemes suffice for optimal persuasion. The authors also propose an approximation scheme for computing approximately-persuasive promise-form signaling schemes with good payoff guarantees, that is polynomial in the approximation factor.

Strengths

+ The paper considers an interesting variation of the sequential persuasion problem, allowing for far-sighted receivers. This makes the problem substantially more complex. Nevertheless, the paper identifies a class of relatively simple and approximately persuasive signaling schemes that nevertheless achieve optimal payoffs for the sender, and are furthermore computationally tractable. + The paper illustrates well the insufficiency of the class of Markovian signaling schemes, and furthermore (adapting existing results) shows that finding a constant-factor approximation within the class of Markovian signaling schemes is NP-hard. + The class of promise-form signaling schemes is fairly simple and easy to implement; furthermore, it seems approximately-optimal such schemes can be computed via solving an LP (repeatedly).

Weaknesses

+ While the class of promise-form signaling schemes is interesting, there is a significant line of work in economics that studies the use of promises in repeated games with incomplete information. The paper does not cite those papers, nor does it place its contributions within that context. A particularly relevant paper in this line is Abreu, Pierce and Stacchetti (Econometrica, 1990), whose results imply the sufficiency of the class of "promise-form" strategies for discounted repeated games with imperfect monitoring. + Similarly, the paper would benefit from connecting with general literature on repeated games (with or without incomplete information). For instance, the insufficiency of Markov signaling schemes is very much in the same vein as the inefficiency of Markov perfect equilibria in, say, repeated prisoner's dilemma to sustain cooperation. With far-sighted receivers, it is not surprising that Markov signaling schemes are not optimal for the sender. + $\epsilon$-persuasiveness: In the analysis of history-dependent (or promise-form) signaling schemes, the authors relax the persuasiveness requirement to $\epsilon$-persuasiveness. There is a subtle issue in interpreting this relaxation. To explain, a natural relaxation would be that the receiver's expected continuation payoff from following the recommendation is at most $\epsilon$ worse than choosing any other action, *after* receiving the recommendation. Specifically, the expectation taken here would be with respect to the posterior belief after receiving the recommendation. However, the condition in Definition 1 requires something different; it states that the receiver's expected payoff from following a recommendation, *multiplied* by the probability of receiving that recommendation, should be at most $\epsilon$ worse. In particular, there is an extra factor equaling the probability of recommending a particular action. While this may seem like a minor technical issue, this has substantial implication on the assumption that the receiver would adopt such a recommendation. For instance, this suggests that as long as the probability of recommending an action is small, the sender can recommend an action that can yield substantially lower continuation payoff for the receiver, and still expect the receiver to accept the recommendation. This seems to be a very strong assumption on the receiver's behavior, that does not align with the assumption that the receivers are (approximately) Bayesian. Moreover, with such a strong assumption, it is no longer clear if $OPT$ is the right benchmark for comparison. A potential fix to this issue would be to impose the relaxation on the conditional expectation, i.e., to replace the $\epsilon$ term in the definition with $\epsilon \sum_{\theta} \mu_h(\theta|s_h)\phi_\tau(a|\theta)$. However, it is not clear if the later approximation results continue to apply with this change. + Finally, while the paper makes sound and rigorous technical contribution, there is not enough discussion motivating the specific model being studied. For instance, there is no discussion of the motivation behind far-sightedness assumption; the myopic behavior of the receivers in previous work is frequently motivated by assuming a series of short-lived receivers. In particular, are there any specific applications where a single sender and a single receiver interact in the manner studied? (I think this is especially useful given the somewhat complicated form of the signaling scheme proposed.) Some discussion here would benefit the paper by grounding the theoretical results.

Questions

+ Do the approximation results continue to hold if the relaxation of the persuasiveness constraint is imposed on the conditional expectation? + With the current definition of $\epsilon$-persuasiveness, it may be possible to design mechanisms that achieve payoffs substantially better than $OPT$. Are there any guarantees on how small (or large) this difference can be?

Rating

6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.

Confidence

5: You are absolutely certain about your assessment. You are very familiar with the related work and checked the math/other details carefully.

Soundness

3 good

Presentation

3 good

Contribution

2 fair

Limitations

The assumptions are stated clearly. Some discussion of the limitations induced by relaxing the persuasiveness/honesty requirements would be helpful.

Reviewer bcaS2023-08-10

I was referring to the point that the actual persuasiveness constraint is on the conditional expectation, something along the lines of $\sum_{\omega} \phi(\omega | a) u(\omega, a) \geq \sum_{\omega} \phi(\omega | a) u(\omega, a')$. Here $\phi(\omega|a)$ is the conditional belief after receiving signal $a$. (I am using simplified notation here but hopefully it is still clear.) If this is relaxed to $\sum_{\omega} \phi(\omega | a) u(\omega, a) \geq \sum_{\omega} \phi(\omega | a) u(\omega, a') - \epsilon$, then this is a perfectly fine model of receiver behavior where one posits that any $\epsilon$-optimal action will be accepted by the receiver. However, currently the persuasiveness constraint is first modified to a unconditional form $\sum_{\omega} \phi(\omega , a) u(\omega, a) \geq \sum_{\omega} \phi(\omega , a) u(\omega, a') $, where $\phi(\omega,a)$ is the joint distribution of state and signal. (This is common trick in exact static settings to get to an LP formulation.) Then, this modified constraint is relaxed to an approximate version: $\sum_{\omega} \phi(\omega , a) u(\omega, a) \geq \sum_{\omega} \phi(\omega , a) u(\omega, a')- \delta$. However, if one goes back to the original (meaningful) persuasiveness constraint, this two-step relaxation amounts to modifying the original persuasiveness constraint as follows: $\sum_{\omega} \phi(\omega |a) u(\omega, a) \geq \sum_{\omega} \phi(\omega | a) u(\omega, a') - \frac{\delta}{\phi(a)}$, where $\phi(a)$ is the unconditional probability of sending signal $a$. Now, this constraint posits a behavioral assumption on the receiver that they will be willing to follow the recommendation as along as it is approximately persuasive, where the approximation can depend also on the probability with which each signal is sent. In particular, as along as a signal is sent with small enough probability (i.e., as long as $\phi(a) \ll 1$), the receiver will gladly adopt the signal. Moreover, the behavior of the receiver changes based on the signal mechanism chosen by the sender. From a behavioral perspective, this situation seems very suspect. My question was whether the results in the paper continue to hold if we adopt the (more appropriate) approximation of $\sum_{\omega} \phi(\omega | a) u(\omega, a) \geq \sum_{\omega} \phi(\omega | a) u(\omega, a') - \epsilon$.

Authorsrebuttal2023-08-16

In the following we use *unnormalized* for describing the current definition of $\epsilon$-persuasiveness and with *normalized* the one proposed by the reviewer. We thank the reviewer for carefully clarifying this point. We decided to consider the unnormalized version of the $\epsilon$-persuasiveness since it is the standard way of defining approximate IC constraints in similar lines of work (e.g [Farina, Gabriele, et al. “Simple uncoupled no-regret learning dynamics for extensive-form correlated equilibrium”]). However we are now persuaded that the normalized version of the $\epsilon$-persuasive constraint is more appropriate for our work in which Bayesian rationality of the agents is a central concept and we agree that this makes the definition more sound from a behavioral perspective. Moreover, changing the definition to the normalized version comes at almost no cost. Indeed, we never directly use the definition of $\epsilon$-persuasiveness in the algorithmic part of the paper (Sections 5 and 6) . We use the definition of $\epsilon$-persuasiveness only in the proof of Lemma 3. In particular, we only use the fact that $\eta$-honest promise form signaling schemes are $H \eta$-persuasive (unnormalized definition) which is proved in Lemma 3. However the proof of Lemma 3 can be easily modified to show that $\eta$-honest promise form signaling schemes are $H \eta$-persuasive (normalized definition). Specifically, we only need to maintain the term $\sum_{\theta\in\Theta}\mu_h(\theta|s_h)\varphi_h(a| s_h,\iota_\tau^\sigma,\theta)$ in front of the $\eta(H-h)$ term in the last Equation after line 574. Notice that here we used an equivalent definition of normalized $\epsilon$-persuasiveness. In particular, using your notation, $\sum_\omega \phi(\omega|a) u(\omega,a) \ge \sum_\omega \phi(\omega|a) u(\omega,a’) - \epsilon$ is equivalent to $\sum_\omega \mu_\omega \phi(a|\omega) u(\omega,a) \ge \sum_\omega \mu_\omega \phi(a|\omega) u(\omega,a’) -\epsilon \sum_\omega \mu_\omega \phi(a|\omega)$. This shows that all the results of our paper still apply to the new normalized version of approximate persuasiveness constraints. We will implement these changes in the final version of the paper. We are very thankful to the reviewer for the discussion which we think greatly improved our paper.

Reviewer bcaS2023-08-17

I acknowledge the response, and am glad to hear my comments were helpful in improving the paper.

Reviewer Rxqa2023-08-18

I appreciate the authors' detailed response. After reading the rebuttal and other reviews, I decide to maintain my initial score.

Reviewer q53d2023-08-21

Response

I've read other reviews and the rebuttal. The evaluation remains the same with the rebuttal (as not much more information is provided in the rebuttal). I thank the authors for the response.

Program Chairsdecision2023-09-21

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC