Sciweavers

NDJFL
1998
81views more  NDJFL 1998»
13 years 3 months ago
An Undecidable Linear Order That Is n-Decidable for All n
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
John Chisholm, Michael Moses
JSYML
2007
66views more  JSYML 2007»
13 years 3 months ago
Spectra of structures and relations
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
Valentina S. Harizanov, Russel G. Miller
ANOR
2008
69views more  ANOR 2008»
13 years 3 months ago
NP-hardness results for the aggregation of linear orders into median orders
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
Olivier Hudry
AAAI
2008
13 years 6 months ago
Voting on Multiattribute Domains with Cyclic Preferential Dependencies
In group decision making, often the agents need to decide on multiple attributes at the same time, so that there are exponentially many alternatives. In this case, it is unrealist...
Lirong Xia, Vincent Conitzer, Jérôme ...