Sciweavers

ATAL
2015
Springer
9 years 11 months ago
On the Parameterized Complexity of Minimax Approval Voting
In this work, we initiate a detailed study of the parameterized complexity of Minimax Approval Voting. We demonstrate that the problem is W[2]-hard when parameterized by the size ...
Neeldhara Misra, Arshed Nabeel, Harman Singh
ATAL
2015
Springer
9 years 11 months ago
Spiteful Bidding in the Dollar Auction
Marcin Waniek, Agata Niescieruk, Tomasz P. Michala...
71
Voted
ATAL
2015
Springer
9 years 11 months ago
Truthful Interval Cover Mechanisms for Crowdsourcing Applications
The varying nature of qualities and costs of the crowdworkers makes task allocation a non-trivial problem in almost all crowdsourcing applications. If crowdworkers are strategic a...
Pankaj Dayama, Balakrishnan Narayanaswamy, Dinesh ...
73
Voted
ATAL
2015
Springer
9 years 11 months ago
On the Susceptibility of the Deferred Acceptance Algorithm
The Deferred Acceptance Algorithm (DAA) is the most widely accepted and used algorithm to match students, workers, or residents to colleges, firms or hospitals respectively. In t...
Haris Aziz, Hans Georg Seedig, Jana Karina von Wed...