OBVIOUSLY STRATEGY-PROOFNESS AND GENERALIZED MEDIAN VOTER SCHEMES

R. PABLO ARRIBILLAGA; ALEJANDRO NEME; JORDI MASSO

Congreso; VII Congreso de Matemática Aplicada, Computacional e Industrial; 2019

The set of all strategy-proof and onto social choice functions on the domain of single-peaked preferences over a finite and linearly ordered set of alternatives coincides with the class of all generalized median voter schemes. Our objective in this paper is to characterize the subclass of generalized median voter schemes that, in addition of being strategy-proof, are also obviously strategy-proof. Our proof is constructive: for each obviously strategy-proof generalized median voter scheme we define an extensive game form that implements it in obviously dominant strategies