Fair division, a key concern in the design of many social institutions, has for 70 years been
the subject of interdisciplinary research at the interface of mathematics, economics, and …

We study the problem of allocating a set of indivisible goods among a set of agents in a fair
and efficient manner. An allocation is said to be fair if it is envy-free up to one good (EF1) …

Given a separation oracle for a convex set K⊂ ℝ n that is contained in a box of radius R, the
goal is to either compute a point in K or prove that K does not contain a ball of radius є. We …

Experiments in social computation Page 1 56 CommuniCAtionS oF thE ACm | oCTobeR
2012 | VoL. 55 | no. 10 contributed articles Ill us tra t Ion b yr and yl yhus since 2005, We have …

The emerging edge computing paradigm promises to deliver superior user experience and
enable a wide range of Internet of Things (IoT) applications. In this paper, we propose a new …

We study the problem of pricing items for sale to consumers so as to maximize the seller's
revenue. We assume that for each consumer, we know the maximum amount he would be …

Massive MIMO is one of the most promising approaches for co** with the predicted
wireless data traffic explosion. Future deployment scenarios will involve dense …

We consider the problem of online keyword advertising auctions among multiple bidders
with limited budgets, and study a natural bidding heuristic in which advertisers attempt to …

In spatial crowdsourcing, requesters submit their task-related locations and increase the
demand of a local area. The platform prices these tasks and assigns spatial workers to serve …

We study the problem of fair and efficient allocation of a set of indivisible chores to agents
with additive cost functions. We consider the popular fairness notion of envy-freeness up to …