Sciweavers

13457 search results - page 29 / 2692
» Can we elect if we cannot compare
Sort
View
ICDCS
2011
IEEE
12 years 7 months ago
SpotME If You Can: Randomized Responses for Location Obfuscation on Mobile Phones
Abstract—Nowadays companies increasingly aggregate location data from different sources on the Internet to offer locationbased services such as estimating current road traffic c...
Daniele Quercia, Ilias Leontiadis, Liam McNamara, ...
COMCOM
2008
145views more  COMCOM 2008»
13 years 7 months ago
A game-theoretic intrusion detection model for mobile ad hoc networks
In this paper, we address the problem of increasing the effectiveness of an intrusion detection system (IDS) for a cluster of nodes in ad hoc networks. To reduce the performance o...
Hadi Otrok, Noman Mohammed, Lingyu Wang, Mourad De...
SIGECOM
2011
ACM
216views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Strategic sequential voting in multi-issue domains and multiple-election paradoxes
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
Lirong Xia, Vincent Conitzer, Jérôme ...
IPCO
2008
105views Optimization» more  IPCO 2008»
13 years 9 months ago
Can Pure Cutting Plane Algorithms Work?
We discuss an implementation of the lexicographic version of Gomory's fractional cutting plane method and of two heuristics mimicking the latter. In computational testing on a...
Arrigo Zanette, Matteo Fischetti, Egon Balas
AAAI
2010
13 years 9 months ago
Voting Almost Maximizes Social Welfare Despite Limited Communication
In cooperative multiagent systems an alternative that maximizes the social welfare--the sum of utilities--can only be selected if each agent reports its full utility function. Thi...
Ioannis Caragiannis, Ariel D. Procaccia