Optimal online algorithms for an electronic commerce money distribution system

H. Kawazoe, T. Shibuya, T. Tokuyama

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)287-299
Number of pages13
JournalAlgorithmica (New York)
Issue number3
Publication statusPublished - 2002


  • Algorithm analysis
  • Electronic commerce
  • Money distribution system
  • Online algorithm
  • PayPerClick

ASJC Scopus subject areas

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'Optimal online algorithms for an electronic commerce money distribution system'. Together they form a unique fingerprint.

Cite this