Algorithmic Persuasion Through Simulation

• URL: http://arxiv.org/abs/2311.18138v4
• Date: Tue, 11 Jun 2024 15:51:08 GMT
• Title: Algorithmic Persuasion Through Simulation
• Authors: Keegan Harris, Nicole Immorlica, Brendan Lucier, Aleksandrs Slivkins,
• Abstract summary: We study a Bayesian persuasion game where a sender wants to persuade a receiver to take a binary action, such as purchasing a product. The sender is informed about the (binary) state of the world, such as whether the quality of the product is high or low, but only has limited information about the receiver's beliefs and utilities. Motivated by customer surveys, user studies, and recent advances in AI, we allow the sender to learn more about the receiver by querying an oracle that simulates the receiver's behavior.
• Score: 51.23082754429737
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study a Bayesian persuasion game where a sender wants to persuade a receiver to take a binary action, such as purchasing a product. The sender is informed about the (binary) state of the world, such as whether the quality of the product is high or low, but only has limited information about the receiver's beliefs and utilities. Motivated by customer surveys, user studies, and recent advances in AI, we allow the sender to learn more about the receiver by querying an oracle that simulates the receiver's behavior. After a fixed number of queries, the sender commits to a messaging policy and the receiver takes the action that maximizes her expected utility given the message she receives. We characterize the sender's optimal messaging policy given any distribution over receiver types. We then design a polynomial-time querying algorithm that optimizes the sender's expected utility in this game. We also consider approximate oracles, more general query structures, and costly queries.

Related papers

• Beyond Thumbs Up/Down: Untangling Challenges of Fine-Grained Feedback for Text-to-Image Generation [67.88747330066049]
  Fine-grained feedback captures nuanced distinctions in image quality and prompt-alignment. We show that demonstrating its superiority to coarse-grained feedback is not automatic. We identify key challenges in eliciting and utilizing fine-grained feedback.
  arXiv  Detail & Related papers  (2024-06-24T17:19:34Z)
• Prompt Optimization with Human Feedback [69.95991134172282]
  We study the problem of prompt optimization with human feedback (POHF) We introduce our algorithm named automated POHF (APOHF) The results demonstrate that our APOHF can efficiently find a good prompt using a small number of preference feedback instances.
  arXiv  Detail & Related papers  (2024-05-27T16:49:29Z)
• Learning How to Strategically Disclose Information [6.267574471145217]
  We consider an online version of information design where a sender interacts with a receiver of an unknown type. We show that $mathcalO(sqrtT)$ regret is achievable with full information feedback. We also propose a novel parametrization that allows the sender to achieve $mathcalO(sqrtT)$ regret for a general convex utility function.
  arXiv  Detail & Related papers  (2024-03-13T17:44:16Z)
• Markov Persuasion Processes: Learning to Persuade from Scratch [37.92189925462977]
  In Bayesian persuasion, an informed sender strategically discloses information to a receiver so as to persuade them to undertake desirable actions. We design a learning algorithm for the sender, working with partial feedback. We prove that its regret with respect to an optimal information-disclosure policy grows sublinearly in the number of episodes.
  arXiv  Detail & Related papers  (2024-02-05T15:09:41Z)
• Persuading a Behavioral Agent: Approximately Best Responding and Learning [7.378697321839991]
  We study a relaxation of the Bayesian persuasion model where the receiver can approximately best respond to the sender's signaling scheme. We show that, under natural assumptions, the sender can find a signaling scheme that guarantees itself an expected utility almost as good as its optimal utility.
  arXiv  Detail & Related papers  (2023-02-07T19:12:46Z)
• Sequential Information Design: Learning to Persuade in the Dark [49.437419242582884]
  We study a repeated information design problem faced by an informed sender who tries to influence the behavior of a self-interested receiver. At each round, the sender observes the realizations of random events in the sequential decision making (SDM) problem. This begets the challenge of how to incrementally disclose such information to the receiver to persuade them to follow (desirable) action recommendations.
  arXiv  Detail & Related papers  (2022-09-08T17:08:12Z)
• Multi-Receiver Online Bayesian Persuasion [51.94795123103707]
  We study an online learning framework in which the sender repeatedly faces a receiver of an unknown, adversarially selected type. We focus on the case with no externalities and binary actions, as customary in offline models. We introduce a general online descent scheme to handle online learning problems with a finite number of possible loss functions.
  arXiv  Detail & Related papers  (2021-06-11T16:05:31Z)
• Learning to Persuade on the Fly: Robustness Against Ignorance [26.915262694667746]
  We study repeated persuasion between a sender and a stream of receivers where at each time, the sender observes a payoff-relevant state drawn independently and identically from an unknown distribution. The sender seeks to persuade the receivers into taking actions aligned with the sender's preference by selectively sharing state information. In contrast to the standard models, neither the sender nor the receivers know the distribution, and the sender has to persuade while learning the distribution on the fly.
  arXiv  Detail & Related papers  (2021-02-19T21:02:15Z)
• Meaningful Answer Generation of E-Commerce Question-Answering [77.89755281215079]
  In e-commerce portals, generating answers for product-related questions has become a crucial task. In this paper, we propose a novel generative neural model, called the Meaningful Product Answer Generator (MPAG) MPAG alleviates the safe answer problem by taking product reviews, product attributes, and a prototype answer into consideration.
  arXiv  Detail & Related papers  (2020-11-14T14:05:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.