AI Chat AI Image Generator AI Video Text to Speech

On the Computational Properties of Obviously Strategy-Proof Mechanisms

01/13/2021
∙
by   Louis Golowich, et al.
∙
0
∙

We present a polynomial-time algorithm that determines, given some choice rule, whether there exists an obviously strategy-proof mechanism for that choice rule.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 07/28/2020

A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs

We give a polynomial-time algorithm for detecting very long cycles in de...
0 Viresh Patel, et al. ∙
research
∙ 10/29/2014

A Statistical Decision-Theoretic Framework for Social Choice

In this paper, we take a statistical decision-theoretic viewpoint on soc...
0 Hossein Azari Soufiani, et al. ∙
research
∙ 07/13/2000

Polynomial-time Computation via Local Inference Relations

We consider the concept of a local set of inference rules. A local rule ...
0 Robert Givan, et al. ∙
research
∙ 09/23/2018

A Revised and Verified Proof of the Scalable Commutativity Rule

This paper explains a flaw in the published proof of the Scalable Commut...
0 Lillian Tsai, et al. ∙
research
∙ 04/11/2018

Manipulation-resistant facility location mechanisms for ZV-line graphs

In many real-life scenarios, a group of agents needs to agree on a commo...
0 Ilan Nehama, et al. ∙
research
∙ 12/13/2017

Recognizing Linked Domain in Polynomial Time

The celebrated Gibbard-Satterthwaite Theorem states that any surjective ...
0 Yongjie Yang, et al. ∙
research
∙ 06/04/2018

A fairer penalty shootout design in soccer

Penalty shootout in soccer is known to be unfair ex post: the team kicki...
0 László Csató, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal