This paper investigates the notion of the maximality effect and its formal implementation. It will be shown that the maximal witness sets that an anaphor can access are sensitive to the plural readings of the anaphor’s antecedents. It will also be shown that the formal semantics of the maximality effect should not be implemented on the interpretation of either determiners or anaphors. Instead, ...

We have a set of nodes each having one color out of There is a plurality of nodes having the same color. We want to reach consensus on the plurality color.

Let V be a set of n points in R, which we call voters, where d is a fixed constant. A point p ∈ R is preferred over another point p′ ∈ R by a voter v ∈ V if dist(v, p) < dist(v, p′). A point p is called a plurality point if it is preferred by at least as many voters as any other point p′. We present an algorithm that decides in O(n logn) time whether V admits a plurality point in the L2 norm an...

Applicant: Svetlana Obraztsova Home institution: Hebrew University of Jerusalem Home country: Israel Host:Edith Elkind Host institution: University of Oxford Host country: United Kingdom Dates: 09-03-2016 to 20-03-2016 During my visit to University of Oxford I closely worked with my host, Prof. Elkind. Our main discussion was about Trembling Hand equilibria for Voting games, precisely, to Votin...

Plurality consensus considers a network of n nodes, each having one of k opinions. Nodes execute a (randomized) distributed protocol with the goal that all nodes adopt the plurality (the opinion initially supported by the most nodes). Communication is realized via the Gossip (or random phone call) model. A major open question has been whether there is a protocol for the complete graph that conv...