Optimization Online


Rank aggregation in cyclic sequences

Javier Alcaraz(jalcaraz***at***umh.es)
Eva García-Nove(eva.garcian***at***goumh.umh.es)
Mercedes Landete(landete***at***umh.es)
Juan Francisco Monge(monge***at***umh.es)
Justo Puerto(puerto***at***us.es)

Abstract: In this paper we propose the problem of finding the cyclic sequence which best represents a set of cyclic sequences. Given a set of elements and a precedence cost matrix we look for the cyclic sequence of the elements which is at minimum distance from all the ranks when the permutation metric distance is the Kendall Tau distance. In other words, the problem consists of finding a robust cyclic rank with respect to a set of elements. This problem originates from the Rank Aggregation Problem for combining different linear ranks of elements. Later we define a probability measure based on dissimilarity between cyclic sequences based on the Kendall Tau distance. Next, we also introduce the problem of finding the cyclic sequence with minimum expected cost with respect to that probability measure. Finally, we establish certain relationships among some classical problems and the new problems that we have proposed.

Keywords: Linear Ordering Problem, Rank Aggregation Problem.

Category 1: Combinatorial Optimization (Other )

Category 2: Integer Programming (0-1 Programming )


Download: [PDF]

Entry Submitted: 10/20/2015
Entry Accepted: 10/20/2015
Entry Last Modified: 10/20/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society