The Myerson-Satterthwaite theorem is a foundational impossibility result in mechanism design which states that no mechanism can be Bayes-Nash incentive compatible, individually rational, and not run a deficit. It holds universally for priors that are continuous, gapless, and overlapping. Using automated mechanism design, we investigate how often the impossibility occurs over discrete valuation ...

In the last few years, applications such practical verifiable computation, anonymous cryptocurrencies (e.g. Zcash), signature of knowledge and etc have made succinct non-interactive arguments (SNARGs) as an active research area for ground-breaking researchers. A non-interactive computationally sound argument (proof system) for NP is succinct if the its proof size is polylogarithmic the instance...