Optimal online algorithms for an electronic commerce money distribution system

H. Kawazoe; T. Shibuya; T. Tokuyama

doi:10.1007/s00453-001-0120-9

Optimal online algorithms for an electronic commerce money distribution system

H. Kawazoe, T. Shibuya, T. Tokuyama

INF - System Information Sciences

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	287-299
Number of pages	13
Journal	Algorithmica (New York)
Volume	33
Issue number	3
DOIs	https://doi.org/10.1007/s00453-001-0120-9
Publication status	Published - 2002

Keywords

Algorithm analysis
Electronic commerce
Money distribution system
Online algorithm
PayPerClick

ASJC Scopus subject areas

Computer Science(all)
Computer Science Applications
Applied Mathematics

Access to Document

10.1007/s00453-001-0120-9

Cite this

@article{e980426bf6bb4e71984920fde675098b,

title = "Optimal online algorithms for an electronic commerce money distribution system",

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.",

keywords = "Algorithm analysis, Electronic commerce, Money distribution system, Online algorithm, PayPerClick",

author = "H. Kawazoe and T. Shibuya and T. Tokuyama",

year = "2002",

doi = "10.1007/s00453-001-0120-9",

language = "English",

volume = "33",

pages = "287--299",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - Optimal online algorithms for an electronic commerce money distribution system

AU - Kawazoe, H.

AU - Shibuya, T.

AU - Tokuyama, T.

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

KW - Algorithm analysis

KW - Electronic commerce

KW - Money distribution system

KW - Online algorithm

KW - PayPerClick

UR - http://www.scopus.com/inward/record.url?scp=0141922705&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0141922705&partnerID=8YFLogxK

U2 - 10.1007/s00453-001-0120-9

DO - 10.1007/s00453-001-0120-9

M3 - Article

AN - SCOPUS:0141922705

VL - 33

SP - 287

EP - 299

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 3

ER -

Optimal online algorithms for an electronic commerce money distribution system

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this