Results

**1 - 2**of**2**### Market Equilibrium with Transaction Costs

"... Abstract. Identical products being sold at different prices in different locations is a common phenomenon. To model such scenarios, we supplement the classical Fisher market model by introducing transaction costs. For every buyer i and good j, there is a transaction cost of cij; if the price of good ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract. Identical products being sold at different prices in different locations is a common phenomenon. To model such scenarios, we supplement the classical Fisher market model by introducing transaction costs. For every buyer i and good j, there is a transaction cost of cij; if the price of good j is pj, then the cost to the buyer i per unit of j is pj +cij. The same good can thus be sold at different (effective) prices to different buyers. We provide a combinatorial algorithm that computes ǫ-approximate equilibrium prices and allocations in O ( 1 ǫ (n+logm)mnlog(B/ǫ)) operations- where m is the number goods, n is the number of buyers and B is the sum of the budgets of all the buyers.

### + 1) competitive algorithm, with essentially the same

"... We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scaling to minimize the sum of energy and weighted flow time. We give an algorithm with an almost optimal competitive ratio for arbitrary power functions. (No earlier results handled arbitrary power functio ..."

Abstract
- Add to MetaCart

We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scaling to minimize the sum of energy and weighted flow time. We give an algorithm with an almost optimal competitive ratio for arbitrary power functions. (No earlier results handled arbitrary power functions for minimizing flow time plus energy with unrelated machines.) For power functions of the form f(s) = sα for some constant α> 1, we get a competitive ratio of O ( α logα), improving upon a previous competitive ratio of O(α2) by Anand et al. [3], along with a matching lower bound of Ω ( α logα). Further, in the resource augmentation model, with a 1 + speed up, we give a