Recognizing Linked Domain in Polynomial Time

12/13/2017
by   Yongjie Yang, et al.
0

The celebrated Gibbard-Satterthwaite Theorem states that any surjective social choice function which is defined over the universal domain of preferences and is strategy-proof must be dictatorial. Aswal, Chatterji and Sen generalize the Gibbard-Satterthwaite theorem by showing that the Gibbard-Satterthwaite theorem still holds if the universal domain is replaced with the linked domain. In this note, we show that determining whether an election is linked can be done in polynomial time.

READ FULL TEXT

page 1

page 2

research
01/25/2022

A simple and constructive proof to a generalization of Lüroth's theorem

A generalization of Lüroth's theorem expresses that every transcendence ...
research
04/30/2019

Case Study of the Proof of Cook's theorem - Interpretation of A(w)

Cook's theorem is commonly expressed such as any polynomial time-verifia...
research
02/02/2018

Optimal probabilistic polynomial time compression and the Slepian-Wolf theorem: tighter version and simple proofs

We give simplify the proofs of the 2 results in Marius Zimand's paper "K...
research
01/13/2021

On the Computational Properties of Obviously Strategy-Proof Mechanisms

We present a polynomial-time algorithm that determines, given some choic...
research
04/11/2020

Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms

This paper is devoted to a study of single-peakedness on arbitrary graph...
research
05/06/2019

The complexity of MinRank

In this note, we leverage some of our results from arXiv:1706.06319 to p...
research
11/11/2019

Universal almost optimal compression and Slepian-Wolf coding in probabilistic polynomial time

In a lossless compression system with target lengths, a compressor C map...

Please sign up or login with your details

Forgot password? Click here to reset