Refreshments will be served
Speaker: Ryszard Janicki
Time/Place: Monday February 16, 2015, 6:00-7:00pm, in Del Norte 1545
Title: On Pairwise Comparisons Based Rankings
Bio: Ryszard Janicki received the M.Sc. degree in applied mathematics from the Warsaw University of Technology, Poland in 1975, and the Ph.D. and Habiliatation in computer science from the Polish Academy of Sciences, Warsaw, Poland in 1977 and 1981 respectively. He taught computer science and mathematics at the Warsaw University of Technology, Poland and Aalborg University, Denmark in, before joining McMaster University, Hamilton, Ontario in 1986. He published more than 120 papers and coauthored a monograph on concurrency theory. He is a member of the Editorial Board of Fundamenta Informaticae and Journal of Computational Science. His research interests include concurrency theory, fundamentals of software engineering, mereology, ranking theory and relational methods in computer science.
Abstract: The talk will be devoted to various aspects of pairwise comparisons based ranking. Both standard numerical case and more abstract non-numerical case and their relationship will be discussed. The concept of consistency, for both models, numerical and non-numerical, will be analyzed. Moreover, partially ordered approximations of arbitrary binary relations will formally be defined and some solutions proposed. The problem of testing and the importance of indifference and the power of weak order extensions will also be discussed.