5158 search results - page 821 / 1032 » Generalization of the Dempster-Shafer Theory |
145
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
187
click to vote
CCS
2010
ACM
15 years 6 months ago
2010
ACM
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
202
click to vote
DM
2008
15 years 6 months ago
2008
Tolerance spaces and algebraic structures with compatible tolerances play an important role in contemporary algebra and their applications. In this contribution we are presenting ...
168
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
190
click to vote
JAIR
2008
15 years 6 months ago
2008
It is well-known that acting in an individually rational manner, according to the principles of classical game theory, may lead to sub-optimal solutions in a class of problems nam...