Presentation 2006-09-26
An Efficient and Self-Stabilizing Link Formation Algorithm
Jun KINIWA, Kensaku KIKUTA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes a self-stabilizing link formation algo-rithm for agent oriented networks. The algorithm is developed on the basis of a cooperative network formation game. In contrast to the conventional literature, the structure of our network has an arbitrary topology, which takes the bounded interaction of agents into account. Our algorithm consists of constructing a multiple rooted tree and forming (or severing) links based on pairwise stability with transfers, where only link formation or severance is privileged by a token. Though it is known that there may be inefficient stability or cyclic transitions, our method eventually provides the efficient network in the sense that no other formation provides agents with higher payoff.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) self-stabilization / network formation game / agent oriented network / multiple rooted tree
Paper # COMP2006-28
Date of Issue

Conference Information
Committee COMP
Conference Date 2006/9/19(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 Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Efficient and Self-Stabilizing Link Formation Algorithm
Sub Title (in English)
Keyword(1) self-stabilization
Keyword(2) network formation game
Keyword(3) agent oriented network
Keyword(4) multiple rooted tree
1st Author's Name Jun KINIWA
1st Author's Affiliation Department of Applied Economics()
2nd Author's Name Kensaku KIKUTA
2nd Author's Affiliation Department of Strategic Management, University of Hyogo
Date 2006-09-26
Paper # COMP2006-28
Volume (vol) vol.106
Number (no) 258
Page pp.pp.-
#Pages 8
Date of Issue