Just as in linear programming, duality theorem plays a basic and an important role in theory as well as in algorithmics. Based on the discretization method and convergence property, this paper proposes a new pr
In order to cope with strong time lower bounds, Korman, Kutten, and Peleg [29] have introduced the proof-labeling schemes (PLSs) computational model, where nodes are given auxiliary global information in the form of labels. A proof-labeling scheme for a predicate P consists of a prover and...
strong dualityWe provide a simple proof of strong duality for the linear persuasion problem. The duality is established in Dworczak and Martini (2019), under slightly strongedoi:10.2139/ssrn.3426166Dizdar, DenizKová, EugenSocial Science Electronic Publishing...
A simple proof of strong duality in the linear persuasion problemBayesian persuasionInformation designStrong dualityWe provide a simple proof of strong duality for the linear persuasion problem. The duality is established in Dworczak and Martini (2019), under slightly stronger assumptions, using ...
Strong dualityWe provide a simple proof of strong duality for the linear persuasion problem. The duality is established in Dworczak and Martini (2019), under slightly stronger assumptions, using techniques from the literature on optimization with stochastic dominance constraints and several approximation...