This thesis studies Bayesian-robustness of algorithm design. The main perspective requires for a single fixed algorithm that its performance is an approximation of the optimal performance when its inputs are independent and identical draws (i.i.d.) from every unknown distribution which is an element of a known, large class of distributions....
Motivated by real-world problems in various fields, mechanism design governs the design of protocols for strategic agents and has applications both in computer science and economics. Due to the revelation principle – a seminal observation in mechanism design, a vast number of studies in mechanism design focus on revelation mechanisms...