Combining Information by Communication: the dynamics of belief merge
|
Supervisor |
|
|
Suitable for |
Abstract
As usually considered, the problem of "preference merge" or "belief merge" is to find a natural, reasonable, "fair" merge operation (subject to various naturality or fairness conditions), for merging the agents' preferences into one "group preference". Depending on the stringency of the required conditions, one can obtain either an Impossibility Theorem (such as Arrow's theorem) or a classification of the possible types of merge operations.
This project treats preference merge and belief merge as instances of "combining information" by various forms of communication. For each specific type of communication channel or type of communicative actions, one can ask the question: what types of belief merge can be achieved by exchanging information only along this channel (or only using these actions)?
Background Needed
The project assumes some familiarity with basic modal logic or a facility to quickly learn it.