BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UC Irvine Donald Bren School of Information & Computer Sciences - ECPv6.3.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:UC Irvine Donald Bren School of Information & Computer Sciences
X-ORIGINAL-URL:https://ics.uci.edu
X-WR-CALDESC:Events for UC Irvine Donald Bren School of Information & Computer Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20261119T160000
DTEND;TZID=America/Los_Angeles:20261119T170000
DTSTAMP:20261012T061236
CREATED:20260820T212147Z
LAST-MODIFIED:20260915T165435Z
UID:30166-1795104000-1795107600@ics.uci.edu
SUMMARY:Rating Competitors in Games with Strength-dependent Tie Probabilities
DESCRIPTION:Abstract: Competitor rating systems for head-to-head games are typically used to measure playing strength from game outcomes. Ratings computed from these systems are often used to select top competitors for elite events\, for pairing players of similar strength in online gaming\, and for players to track their own strength over time. Most implemented rating systems assume only win/loss outcomes\, and treat occurrences of ties as the equivalent to half a win and half a loss. However\, in games such as chess\, the probability of a tie (draw) is demonstrably higher for stronger players than for weaker players\, so that rating systems ignoring this aspect of game results may produce strength estimates that are unreliable. We develop a new rating system for head-to-head games that explicitly acknowledges a tie as a third outcome\, and that the probability of a tie may depend on the strengths of the competitors. Our approach relies on time-varying game outcomes following a Bayesian dynamic modeling framework\, and that posterior updates within a time period are approximated by one iteration of Newton-Raphson evaluated at the prior mean. The approach is demonstrated on a large dataset of chess games played in International Correspondence Chess Federation tournaments.
URL:https://ics.uci.edu/event/rating-competitors-in-games-with-strength-dependent-tie-probabilities/
LOCATION:Donald Bren Hall\, Irvine\, CA\, 92697\, United States
ATTACH;FMTTYPE=image/jpeg:https://ics.uci.edu/wp-content/uploads/2026/08/MarkGlickman-450x450-1.jpg
END:VEVENT
END:VCALENDAR