Sciweavers

490 search results - page 40 / 98
» Impossibilities for roommate problems
Sort
View
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
ESA
2006
Springer
207views Algorithms» more  ESA 2006»
14 years 15 days ago
Cheating by Men in the Gale-Shapley Stable Matching Algorithm
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...
Chien-Chung Huang
EUROCRYPT
2008
Springer
13 years 10 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
ADHOCNOW
2009
Springer
13 years 10 months ago
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
IJDSN
2006
132views more  IJDSN 2006»
13 years 8 months ago
Using Misbehavior to Analyze Strategic versus Aggregate Energy Minimization in Wireless Sensor Networks
Abstract-- We present a novel formulation of the problem of energy misbehavior and develop an analytical framework for quantifying its impact on other nodes. Specifically, we formu...
Rajgopal Kannan, Shuangqing Wei, Vasu Chakravarthy...