Abstract. We consider the money distribution problem for a micro-payment scheme using a distributed server system; in particular, for an automatic charging scheme named PayPerClick that allows Internet users to view Web pages for which access charges are levied without tedious payment procedures. A major bottleneck in the scheme is the network traffic caused by the distribution of electronic money to many different servers. We propose a simple online algorithm for distributing electronic money to servers so that the network traffic is minimized. The algorithm achieves the optimal online competitive ratio. We also consider a weighted version, for which we give an asymptotically optimal online algorithm within a constant factor.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kawazoe, ., Shibuya, . & Tokuyama, . Optimal Online Algorithms for an Electronic Commerce Money Distribution System . Algorithmica 33, 287–299 (2002). https://doi.org/10.1007/s00453-001-0120-9
Issue Date:
DOI: https://doi.org/10.1007/s00453-001-0120-9