Title: "Obvious Strategy-proofness with Respect to a Partition"
Abstract:
We define and study obvious strategy-proofness with respect to a
partition of the set of agents. It encompasses strategy-proofness as a
special case when the partition is the coarsest one and obvious
strategy-proofness when the partition is the finest. For any partition,
it falls between these two extremes. We establish two general properties
of this new notion and apply it to the simple voting problem with two
alternatives and strict preferences.
To obtain the Zoom link, please subscribe to the Seminar Mailing List, or contact one of the organisers.
Reminder: On the seminar website
you can find the video recordings, slides and supplementary materials
for all past presentations, as well as information about future
presentations.