Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Dynamic Epistemic Logic
| Hi-index | 0.00 |
A well-known fact in social choice theory is that strategic voting, also known as manipulation, becomes harder when voters know less about the preferences or votes of other voters. Standard approaches to manipulation in social choice theory [6] as well as in computational social choice [3] assume that the manipulating voter or the manipulating coalition knows perfectly how the other voters will vote. Some approaches [2] assume that voters have a probabilistic prior belief on the outcome of the vote, which encompasses the case where each voter has a probability distribution over the set of profiles. A recent paper [5] extends coalitional manipulation to incomplete knowledge, by distinguishing manipulating from non-manipulating voters and by considering that the manipulating coalition has, for each voter outside the coalition, a set of possible votes encoded in the form of a partial order over candidates. Uncertainty of voters about the uncertainties of other voters, i.e., higher-order beliefs of voters, has not been treated in full generality.