Mark Newman kicks off Complex Systems Seminar Series Sept 5 - 10th Floor Weiser Hall
"Leaders and Best: Networks and Ranking in Sports, Markets, and Society"
Please note this seminar is on the 10th FLOOR of Weiser Hall.
2023 UM Henry Russel Lectureship winner, Mark Newman will kick off our seminar series on the 10th floor of Weiser Hall on Tuesday, September 5, 2023 at 11:30am.
Coffee and snacks will be available starting at 11:15 am.
Mark Newman is the Anatol Rapoport Distinguished University Professor Department of Physics and Center for the Study of Complex Systems and External Faculty at the Santa Fe Institute.
ABSTRACT: One of the oldest of network problems is the ranking of individuals, teams, or commodities on the basis of pairwise comparisons between them. For example, if you know which football teams beat which others in a particular year, can you say which team is the best overall? This is a harder problem than it sounds because not all pairs of teams play games in a given season, and also because the outcomes of the games can be ambiguous or contradictory. This talk will introduce the techniques used to solve such ranking problems, with examples from games and sports, consumer research and marketing, and social hierarchies in both animal and human communities, then ask how those techniques can be extended to answer a range of new questions about competition and ranking, including the development of new computer algorithms for ranking, questions about the varying patterns of competition in different sports, and what happens when individuals or teams compete in multiple different ways.
2023 UM Henry Russel Lectureship winner, Mark Newman will kick off our seminar series on the 10th floor of Weiser Hall on Tuesday, September 5, 2023 at 11:30am.
Coffee and snacks will be available starting at 11:15 am.
Mark Newman is the Anatol Rapoport Distinguished University Professor Department of Physics and Center for the Study of Complex Systems and External Faculty at the Santa Fe Institute.
ABSTRACT: One of the oldest of network problems is the ranking of individuals, teams, or commodities on the basis of pairwise comparisons between them. For example, if you know which football teams beat which others in a particular year, can you say which team is the best overall? This is a harder problem than it sounds because not all pairs of teams play games in a given season, and also because the outcomes of the games can be ambiguous or contradictory. This talk will introduce the techniques used to solve such ranking problems, with examples from games and sports, consumer research and marketing, and social hierarchies in both animal and human communities, then ask how those techniques can be extended to answer a range of new questions about competition and ranking, including the development of new computer algorithms for ranking, questions about the varying patterns of competition in different sports, and what happens when individuals or teams compete in multiple different ways.
| Building: | Weiser Hall |
|---|---|
| Website: | |
| Event Type: | Workshop / Seminar |
| Tags: | Biosciences, colloquium, Natural Sciences, Networks, physics, Research, seminar |
| Source: | Happening @ Michigan from The Center for the Study of Complex Systems, The College of Literature, Science, and the Arts, Department of Physics |
