3 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.GT2013★ 3 cited
Bargaining for Revenue Shares on Tree Trading Networks
Arpita Ghosh, Satyen Kale, Kevin Lang +1
We study trade networks with a tree structure, where a seller with a single indivisible good is connected to buyers, each with some value for the good, via a unique path of interme…
cs.DS2013★ 1 cited
The Complexity of Scheduling for p-norms of Flow and Stretch
Benjamin Moseley, Kirk Pruhs, Cliff Stein
We consider computing optimal k-norm preemptive schedules of jobs that arrive over time. In particular, we show that computing the optimal k-norm of flow schedule, is strongly NP-h…
cs.DS2010★ 1 cited
Scheduling to Minimize Energy and Flow Time in Broadcast Scheduling
Benjamin Moseley
In this paper we initiate the study of minimizing power consumption in the broadcast scheduling model. In this setting there is a wireless transmitter. Over time requests arrive at…