BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UNL_UCBCN//NONSGML UNL Event Publisher//EN
X-WR-CALNAME:University of Nebraska-Lincoln
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTART:20190920T210000Z
UID:140552@events.unl.edu
DTSTAMP:20190513T150115Z
ORGANIZER;CN=Tri Lai:MAILTO:tlai3@unl.edu
SUMMARY:Joel Spencer\, Courant Institute—New York University
DESCRIPTION:In Combinatorial Descrepancy\, Paul selects objects and Carole
balances them into two piles as evenly as possible.\n\nIn this talk the ob
jects will be n n-dimensional vectors with coefficients ±1. Carole assign
s to each vector ±1 (the two piles) and the payoff (which Carole tries to
minimize) is the L-infinity norm of the signed sum.\n\nWe consider four v
ariants of this problem. Paul may play randomly (in which case Carole trie
s to minimize expectation) or adversarially. Carole may play On-Line (sele
cting each sign immediately after seeing its vector) or Off-Line (seeing a
ll vectors and then selecting all signs).\n\nThe arguments (for both Paul
and Carole) involve a combination of appropriate weight functions and prob
abilistic (Carole selects ±1 randomly!) thinking.\n\nThe four variants ar
e all interesting. In each case we know the answer up to constants and in
some cases we know (or nearly know) the constants.\n\nWe emphasize new res
ults\, with Nikhil Bansal\, for the random on-line variant.\n\nAnagram Fan
s!\: Why is Carole spelled with an e?
LOCATION:Avery Hall Room 115 Avery Hall
URL://events.unl.edu/2019/09/20/140552/
DTEND:20190920T215000Z
END:VEVENT
END:VCALENDAR