On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Online computation and competitive analysis
Online computation and competitive analysis
Market Equilibrium via a Primal-Dual-Type Algorithm
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Load balancing in the L/sub p/ norm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Multi-unit auctions with unknown supply
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Greedy primal-dual algorithm for dynamic resource allocation in complex networks
Queueing Systems: Theory and Applications
Online algorithms for market clearing
Journal of the ACM (JACM)
Eisenberg-Gale markets: algorithms and structural properties
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
AdWords and generalized online matching
Journal of the ACM (JACM)
Algorithmic Game Theory
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Online Ad Assignment with Free Disposal
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
New results on rationality and strongly polynomial time solvability in eisenberg-gale markets
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
We study an online version of Fisher's linear case market. In this market there arembuyers and a set of n dividable goods to be allocated to the buyers. The utility that buyer i derives from good j is uij . Given an allocation Û in which buyer i has utility Ûi we suggest a quality measure that is based on taking an average of the ratios Ui/Ûi with respect to any other allocation U. We motivate this quality measure, and show that market equilibrium is the optimal solution with respect to this measure. Our setting is online and so the allocation of each good should be done without any knowledge of the upcoming goods. We design an online algorithm for the problem that is only worse by a logarithmic factor than any other solution with respect to our proposed quality measure, and in particular competes with the market equilibrium allocation. We prove a tight lower bound which shows that our algorithm is optimal up to constants. Our algorithm uses a primal dual convex programming scheme. To the best of our knowledge this is the first time that such a scheme is used in the online framework. We also discuss an application of the framework in display advertising business in the last section.