{"id":26958,"date":"2026-02-28T10:23:32","date_gmt":"2026-02-28T07:23:32","guid":{"rendered":"https:\/\/w3.bilkent.edu.tr\/en\/?p=26958"},"modified":"2026-03-02T22:16:40","modified_gmt":"2026-03-02T19:16:40","slug":"cs-seminar-fair-and-efficient-online-decision-making-yusuf-hakan-kalayci-1000am-march-2-2026-en","status":"publish","type":"post","link":"https:\/\/w3.bilkent.edu.tr\/en\/cs-seminar-fair-and-efficient-online-decision-making-yusuf-hakan-kalayci-1000am-march-2-2026-en\/","title":{"rendered":"CS Seminar: \u201cFair and Efficient Online Decision Making\u201d, Yusuf Hakan Kalayc\u0131, 10:00AM March 2 2026 (EN)"},"content":{"rendered":"<p>Fair and Efficient Online Decision Making<\/p>\n<p>Yusuf Hakan Kalayc\u0131<br \/>\nUniversity of Southern California, Los Angeles<\/p>\n<p>Abstract: As algorithms increasingly automate critical decisions\u2014from AI-powered text generation to democratic representation\u2014it is more important than ever to design decision-making systems that are both efficient and fair. This talk addresses a fundamental challenge in online decision making: how can we decide efficiently and fairly when information arrives sequentially and the future is uncertain? To illustrate my research in this direction, I will present two recent examples. First, on the efficiency front, I show how optimal stopping theory, specifically through the lens of Pandora\u2019s Box, can dramatically improve the efficiency of large language model inference by learning when to stop generating tokens. Second, on the fairness front, I demonstrate how principles from computational social choice can make the selection of permanent citizens\u2019 assemblies more representative over time, ensuring fair representation even for smaller groups as decisions accumulate. Together, these examples showcase how theoretical foundations in online algorithms can address practical challenges in modern AI systems and democratic institutions.<\/p>\n<p>Biography: Yusuf Hakan Kalayci is a Ph.D. candidate in Computer Science at the University of Southern California, where he researches optimal stopping theory and computational social choice with applications to large language models. He earned his B.Sc. in Computer Engineering and Mathematics with High Honors from Bo\u011fazi\u00e7i University. His research has been published in leading conferences including STOC, ITCS, ICALP, AAAI, and AAMAS, and he has served as a reviewer and\/or program committee member for STOC, ESA, and AAAI.<\/p>\n<p>Date: March 2, 2026 Monday @ 10:00<br \/>\nPlace: Zoom<\/p>\n<p>This is an online seminar. To request event details please send a message to department.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Fair and Efficient Online Decision Making Yusuf Hakan Kalayc\u0131 University of Southern California, Los Angeles Abstract: As algorithms increasingly automate critical decisions\u2014from AI-powered text generation to democratic representation\u2014it is more important than ever to design decision-making systems that are both efficient and fair. This talk addresses a fundamental challenge in [\u2026] <\/p>\n<div class=\"clear\"><\/div>\n<p><a class=\"more_link clearfix\" href=\"https:\/\/w3.bilkent.edu.tr\/en\/cs-seminar-fair-and-efficient-online-decision-making-yusuf-hakan-kalayci-1000am-march-2-2026-en\/\" rel=\"nofollow\">Read More<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[12],"tags":[],"class_list":["post-26958","post","type-post","status-publish","format-standard","hentry","category-oldposts"],"_links":{"self":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/26958","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/comments?post=26958"}],"version-history":[{"count":1,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/26958\/revisions"}],"predecessor-version":[{"id":26959,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/26958\/revisions\/26959"}],"wp:attachment":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/media?parent=26958"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/categories?post=26958"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/tags?post=26958"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}