
A polynomialtime algorithm to determine (almost) Hamiltonicity of dense regular graphs
We give a polynomialtime algorithm for detecting very long cycles in de...
read it

A Statistical DecisionTheoretic Framework for Social Choice
In this paper, we take a statistical decisiontheoretic viewpoint on soc...
read it

Polynomialtime Computation via Local Inference Relations
We consider the concept of a local set of inference rules. A local rule ...
read it

Recognizing Linked Domain in Polynomial Time
The celebrated GibbardSatterthwaite Theorem states that any surjective ...
read it

Perspectives and Networks
The perspective we take on a system determines the features and properti...
read it

Manipulationresistant facility location mechanisms for ZVline graphs
In many reallife scenarios, a group of agents needs to agree on a commo...
read it

The HyllandZeckhauser Rule Under BiValued Utilities
The HyllandZeckhauser (HZ) rule is a wellknown rule for probabilistic ...
read it
On the Computational Properties of Obviously StrategyProof Mechanisms
We present a polynomialtime algorithm that determines, given some choice rule, whether there exists an obviously strategyproof mechanism for that choice rule.
READ FULL TEXT
Comments
There are no comments yet.