arXiv subjects

Andriy Zapechelnyuk

Publications and source records attributed to Andriy Zapechelnyuk.

5 recordsLinked to original sources

arXiv2024

On Monotone Persuasion

We study monotone persuasion in the linear case, where posterior distributions over states are summarized by their mean. We solve the two leading cases where optimal unrestricted signals can be nonmonotone. First, if the objective is s-shaped and the state is discrete, then optimal monotone signals are upper censorship, whereas optimal unrestricted signals may require randomization. Second, if the objective is m-shaped and the state is continuous, then optimal monotone signals are interval disclosure, whereas optimal unrestricted signals may require nonmonotone pooling. We illustrate our results with an application to media censorship.

econ.TH↗

arXiv2021

Compromise, Don't Optimize: Generalizing Perfect Bayesian Equilibrium to Allow for Ambiguity

We introduce a solution concept for extensive-form games of incomplete information in which players need not assign likelihoods to what they do not know about the game. This is embedded in a model in which players can hold multiple priors. Players make choices by looking for compromises that yield a good performance under each of their updated priors. Our solution concept is called perfect compromise equilibrium. It generalizes perfect Bayesian equilibrium. We show how it deals with ambiguity in Cournot and Bertrand markets, public good provision, Spence's job market signaling, bilateral trade with common value, and forecasting.

econ.TH↗

arXiv2020

Robust Sequential Search

We study sequential search without priors. Our interest lies in decision rules that are close to being optimal under each prior and after each history. We call these rules dynamically robust. The search literature employs optimal rules based on cutoff strategies that are not dynamically robust. We derive dynamically robust rules and show that their performance exceeds 1/2 of the optimum against binary environments and 1/4 of the optimum against all environments. This performance improves substantially with the outside option value, for instance, it exceeds 2/3 of the optimum if the outside option exceeds 1/6 of the highest possible alternative.

econ.TH↗

arXiv2019

Persuasion Meets Delegation

A principal can restrict an agent's information (the persuasion problem) or restrict an agent's discretion (the delegation problem). We show that these problems are generally equivalent - solving one solves the other. We use tools from the persuasion literature to generalize and extend many results in the delegation literature, as well as to address novel delegation problems, such as monopoly regulation with a participation constraint.

econ.TH↗

arXiv2012

No-regret Dynamics and Fictitious Play

Potential based no-regret dynamics are shown to be related to fictitious play. Roughly, these are epsilon-best reply dynamics where epsilon is the maximal regret, which vanishes with time. This allows for alternative and sometimes much shorter proofs of known results on convergence of no-regret dynamics to the set of Nash equilibria.

math.DS↗