From 004057346a85f4b296084b5bdc83240a5b0344d8 Mon Sep 17 00:00:00 2001
From: dibiyu <105071245+dbyuksel@users.noreply.github.com>
Date: Fri, 1 Nov 2024 17:20:42 +0000
Subject: [PATCH] Update _101.json

---
 _101.json | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/_101.json b/_101.json
index 1ffd05c..d7927d8 100644
--- a/_101.json
+++ b/_101.json
@@ -66,8 +66,8 @@
     "speakerurl": "",
     "institute": "MSP",
     "insturl": "",
-    "title": "How to make good choices",
-    "abstract": "TBD",
+    "title": "How to Make Good Choices",
+    "abstract": "What to do? One way to find out is to explore all the consequences of our choices and pick the best one. Or we could assume we have a magic device that tells us what the outcome of our choice will be, and to pick the best one straight off. In terms of programming, the former can be modelled using a monad for non-deterministic choices and the latter using the Selection monad of Escardo and Oliva. I'll relate these two monads via a logical relation, showing that if we are careful to respect abstraction boundaries, the two are equivalent for closed programs. I'll then extend this correspondence to account for different kinds of choice-making program and see how we can reconstruct concepts like Nash equilibrium. This talk may involve some live coding in Agda.",
     "location": "LT210 and Online",
     "material":  []
   },