Presentation	2002/1/2 Some Problems in an Allocation Mechanism for Digital Goods Shigeo MATSUBARA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	File-sharing systems and content delivery services in peer-to-peer networks offer new opportunities for trading digital goods such as software, audio/video content, and information, which are delivered directly via the network. Unfortunately, these systems involve problems caused by the self-interested nature of agents, an example being the so-called free-riding. To keep the quality of services at a sufficient level, we have to find an efficient allocation of goods and induce each agent's effort. However, solving this problem is difficult because the system designer cannot observe each agent's effort level as well as the agents's cost of providing the services. To solve this problem, we propose a new mechanism that auctions contracts. More specifically, the mechanism first finds an efficient allocation of the goods and then calculates a contract based on the result of the auction. We theoretically analyze the mechanism and demonstrate that the mechanism guarantees that each agent reveals its true information in a single good case.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	auction / contract / electronic commerce / game theory
Paper #	2001-AI-61
Date of Issue

Conference Information
Committee	AI
Conference Date	2002/1/2(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Artificial Intelligence and Knowledge-Based Processing (AI)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Some Problems in an Allocation Mechanism for Digital Goods
Sub Title (in English)
Keyword(1)	auction
Keyword(2)	contract
Keyword(3)	electronic commerce
Keyword(4)	game theory
1st Author's Name	Shigeo MATSUBARA
1st Author's Affiliation	NTT Communication Science Laboratories NTT Corporation()
Date	2002/1/2
Paper #	2001-AI-61
Volume (vol)	vol.101
Number (no)	535
Page	pp.pp.-
#Pages	8
Date of Issue