This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori...
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
We revisit one of the most fundamental problems in multimedia that is receiving enormous attention from researchers without making much progress in solving it: the problem of brid...
Relational autocorrelation is ubiquitous in relational domains. This observed correlation between class labels of linked instances in a network (e.g., two friends are more likely ...
The Optimized Link State Routing (OLSR) protocol is a well-known route discovery protocol for ad-hoc networks. OLSR optimizes the flooding of link state information through the ne...
Jan-Maarten Verbree, Maurits de Graaf, Johann Huri...