Unanimity and transitivity do no imply IIA. For example, consider the Borda-count voting mechanism. There is an example of the violation of IIA here.


There's a recent paper [1] on dense subgraph (i.e. community) detection in the context of distributed computing. In [1], each node of the graph represents an operating entity (i.e. runs an instance of a distributed algorithm) and each node can communicate with its neighboring nodes by sending messages. The graph itself can change (slowly) over time. Note ...

Only top voted, non community-wiki answers of a minimum length are eligible