Search For:

Displaying 1-4 out of 4 total
Global Manhunt Pushes the Limits of Social Mobilization
Found in: Computer
By Iyad Rahwan,Sohan Dsouza,Alex Rutherford,Victor Naroditskiy,James McInerney,Matteo Venanzi,Nicholas R. Jennings,Manuel Cebrian
Issue Date:April 2013
pp. 68-75
Using social media and only the targets' mug shots, a team competing in the US State Department-sponsored Tag Challenge located three of five targeted people in five cities in the US and Europe in less than 12 hours.
Optimal payments in dominant-strategy mechanisms for single-parameter domains
Found in: ACM Transactions on Economics and Computation
By Maria Polukarov, Nicholas R. Jennings, Victor Naroditskiy
Issue Date:January 2013
pp. 1-21
We study dominant-strategy mechanisms in allocation domains where agents have one-dimensional types and quasilinear utilities. Taking an allocation function as an input, we present an algorithmic technique for finding optimal payments in a class of mechani...
Destroy to save
Found in: Proceedings of the tenth ACM conference on Electronic commerce (EC '09)
By Amy Greenwald, Geoffroy de Clippel, Victor Naroditskiy
Issue Date:July 2009
pp. 70-73
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming it. We assume the items are jointly owned by the agents, not by one uninformed center, so a...
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
Found in: Proceeding of the 17th international conference on World Wide Web (WWW '08)
By Victor Naroditskiy, Yunhong Zhou
Issue Date:April 2008
pp. 1-7
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the corresponding bidding optimization problem. Our algorithm selects items onlin...