Presentation	2001/11/20 On the construction of consensus for ordered data represented by directed graph Yoshihiro KANEKO, Shoji SHINODA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	This reports deals with considering how to make consensus from which some ordered data are given. It might happen that some given data would not share such consensus. Thinking of that, we define complaint of each data, which means the difference between the data and their consensus. First, we define concept of Pareto which has no complaint in a sense and show how to get such consensus from given data. Next with the use of flow or maximam tree, we try to make consensus from given data so as to minimize those complaints.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	ordered data / consensus / directed graph / Pareto
Paper #	CAS2001-78,CST2001-31
Date of Issue

Conference Information
Committee	CST
Conference Date	2001/11/20(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	Concurrent System Technology (CST)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	On the construction of consensus for ordered data represented by directed graph
Sub Title (in English)
Keyword(1)	ordered data
Keyword(2)	consensus
Keyword(3)	directed graph
Keyword(4)	Pareto
1st Author's Name	Yoshihiro KANEKO
1st Author's Affiliation	Faculty of Engineering, Gifu University()
2nd Author's Name	Shoji SHINODA
2nd Author's Affiliation	Faculty of Science and Engineerin, Chuo University
Date	2001/11/20
Paper #	CAS2001-78,CST2001-31
Volume (vol)	vol.101
Number (no)	461
Page	pp.pp.-
#Pages	8
Date of Issue