BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a72ba5d68e0e
DTSTART;TZID=America/Toronto:20260703T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260703T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-audrey-beliveau-combinatorial-structure-and
SUMMARY:Tutte Colloquium -Audrey Béliveau-Combinatorial Structure and\nAlg
 orithms for Treatment Rankings
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Audrey Béliveau\n\nAFFILIATION:\n University of Wat
 erloo\n\nLOCATION:\n MC 5501\n\nABSTRACT: Network meta-analysis (NMA) ena
 bles the comparison of\nmultiple medical interventions by combining eviden
 ce on their efficacy\nor safety across clinical trials. Although these mod
 els produce rich\nprobabilistic information about how treatments rank\, wh
 at\npractitioners often want are simple\, interpretable summaries\; for\ne
 xample\, whether a treatment is likely among the best\, or whether one\nop
 tion is likely to outperform another.\n\nThe challenge is that\, with n tr
 eatments\, the number of possible\nquestions one can ask about permutation
 s\, combinations\, or partial\norderings of various subsets of treatments 
 grows exponentially. This\nleads to a large but highly structured combinat
 orial space\, making\nexhaustive evaluation infeasible. \nWe develop algor
 ithmic methods to explore this space efficiently and\nto identify all bina
 ry treatment hierarchy statements whose posterior\nprobability exceeds a s
 pecified threshold (e.g.\, 95%). Our approach\nexploits structure in the r
 anking space to avoid redundant\ncomputations and then prunes conclusions 
 that are logically implied by\nothers\, yielding a concise and non-redunda
 nt set of results. We\nillustrate the approach on an NMA of diabetes treat
 ments.
DTSTAMP:20260805T042149Z
END:VEVENT
END:VCALENDAR