(1) The main focus of the original project is on mechanism design with incomplete information. The usual situation is that the individuals (who are asked to vote, or more generally to provide information or input to the (public) decision mechanism have only partial and uncertain information about the characteristics and preferences of the others. This is modelled by assuming that these individuals have beliefs (i.e. probability assessments) about these characteristics. Within this setting, the project has resulted in the following working paper.
Dipjyoti Majumdar and Souvik Roy (2017): “Random dictatorship of OBIC decision schemes”, working paper
Summary: We consider the problem of characterizing the random social choice functions that are ordinal Bayesian incentive compatible (OBIC) with respect to some common prior belief. It is shown in Majumdar and Sen (2004) that, if the common prior belief is generic, then every
OBIC and ex-post efficient deterministic social choice function on the unrestricted domain is dictatorial. However, we show by means of an example that the same does not hold for OBIC and ex-post efficient random social choice functions. In view of this, we provide a sufficient
condition on the prior belief such that every ex-post efficient, neutral, and OBIC random social choice function is random dictatorial. We also show by means of examples that the ex-post efficiency and neutrality condition in our result are necessary.
Besides this, the following topics have been explored and results achieved:
(2) Strategy-proofness of a decision mechanism means that for each individual it is optimal to provide the correct information about its preferences. For instance, in voting this means that no individual can possibly gain by strategic voting, that is, not voting for its favourite candidate or alternative. Since in practice there is not always a clear-cut candidate or alternative resulting form the reported preferences (e.g. votes) of the individuals, in theory one may resort to probabilistic rules, meaning that one can attach weights to several candidates. This part of the project shows that under certain conditions such probabilistic rules are simply weighted combinations of deterministic rules, i.e. rules that assign exactly one candidate.
More technically, this is the title and short summary of the article that has already been published:
Peters, Hans, Souvik Roy, Soumyarup Sadhukhan, and Ton Storcken (2017): “An Extreme Point Characterization of Strategy-proof and Unanimous Probabilistic Rules over Binary Restricted Domains,” Journal of Mathematical Economics, 69, 84-90.
Summary: We show that every strategy-proof and unanimous probabilistic rule on a binary restricted domain has binary support, and is a probabilistic mixture of strategy-proof and unanimous deterministic rules. Examples of binary restricted domains are single-dipped domains, which are of interest when considering the location of public bads. We also provide an extension to infinitely many alternatives.
(3) This research focuses on matching between institutions and couples. A well-known area of application is the job market for medical doctors, where the jobs of possible partners of the doctors play an important role. So far, this part of the project has resulted in two working papers.
(a) Shashwat Khare and Souvik Roy (2017): “Stability in Matching with Couples having Responsive Preferences”, working paper
Summary: The paper studies matching markets where institutions are matched with possibly more than one individuals. The matching market contains some couples who view the pair of jobs as complements. We show that under responsive preferences, both for couples and hospitals, stable matching may fail to exist. Further we formulate restrictions on the preferences of couples, which are necessary and sufficient for the existence of a stable matching for any responsive preferences of the institutions. Finally, we formulate restrictions on the preferences of the institutions, which are necessary and sufficient for the existence of stable matching for any responsive preferences of the couples.
(b) Shashwat Khare and Souvik Roy (2017): “ Stability in Matching with Couples having Non-Responsive Preferences”, working paper
(4) This part of the project again focuses on strategy-proofness, see (2) above. The classical Gibbard-Satterthwaite result says that there are no strategy-proof rules if the preferences of the individuals can take any form, unless one allows for a dictator, which of course is undesirable. It is also well-known that under certain restrictions on preferences there are nondictatorial strategy-proof rules. This research adds to this literature. Possible applications include the following:
• Determining the geographical location for a public facility, like a hospital, town hall, school, sport facility
• Budget proposals for projects or public issues like education, defense, health care
• Locating obnoxious facilities like nuclear plants or windmills
• Problems concerning manipulation of preference aggregation, where a committee aggregates individual preferences into a collective preference or list, for instance a list of applicants for a vacancy or a list of contestants in a competition
Two papers deal with these issues:
(a) Souvik Roy_and Ton Storcken (2017): “Unanimity and strategy-proofness on short-path-connected domains”, working paper
(b) Gopakumar Achuthankutty and Souvik Roy (2017): “A domain characterization of min-max rules”, working paper
