Exploitation of a bipolar-valued outranking relation for the choice of k best alternatives

Reference : Exploitation of a bipolar-valued outranking relation for the choice of k best alternatives


	Document type :	Scientific congresses, symposiums and conference proceedings : Unpublished conference
	Discipline(s) :	Engineering, computing & technology : Computer science
	Focus Areas :	Computational Sciences
	To cite this reference:	http://hdl.handle.net/10993/45336

Title :	Exploitation of a bipolar-valued outranking relation for the choice of k best alternatives
Language :	English
Author, co-author :	Meyer, Patrick [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Bisdorff, Raymond [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Publication date :	Feb-2007
Number of pages :	193-206
Peer reviewed :	Yes
Audience :	International
Event name :	FRANCORO V / ROADEF 2007
Event date :	from 20-02-2007 to 23-02-2007-
Event organizer :	ROADEF
Event place (city) :	Grenoble
Event country :	France
Keywords :	[en] Algorithmic Decision Theory ; Multi-criteria decision aid ; bipolar-valued outranking digraphs
Abstract :	[en] We present the problem of the selection of k best alternatives in the context of multiple criteria decision aid. We situate ourselves in the context of pairwise comparisons of alternatives and the underlying bipolar-valued outranking digraph. We present three formulations for the best k-choice problem and detail how to solve two of them directly on the outranking digraph.
Research centres :	University of Luxembourg: Computer Science and Communications RU
Target :	Researchers ; Professionals
Permalink :	http://hdl.handle.net/10993/45336

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	pm-wp-07-02-v01.pdf		Author preprint	210.1 kB	View/Open

All documents in ORBi^lu are protected by a user license.