281 search results - page 5 / 57 » A revealed preference approach to computational complexity i... |
DALT
2009
Springer
15 years 26 days ago
2009
Springer
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
COMPLEX
2009
Springer
15 years 4 months ago
2009
Springer
Investors would like to calculate profits in advance, “ex ante”, like the path of a flying ball. But income can only be given “ex post”, after the money is earned. The pro...
AAAI
2007
14 years 11 months ago
2007
Over the past half decade, we have been exploring the use of logic in the specification and analysis of computational economic mechanisms. We believe that this approach has the p...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
ICLP
2001
Springer
15 years 1 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...