| Thursday 21 November 2024 | |
| Events for day: Wednesday 20 November 2024 |
| 14:00 - 15:00 Combinatorics and Computing Weekly Seminar The Offline Carpool Problem Revisited School MATHEMATICS The carpool problem aims to schedule tasks over time t ∈ N from a P set of tasks [n] with each task i having a weight w_i(t) ≥ 0 and satisfying $sum_ {i=1}^n w_i(t) = l$. The objective is to achieve fair scheduling by maintaining a bounded error in cumulative task distribution, especially under online settings where task weights are unknown beforehand. Prior work achieves fairness with |E_i(t)| = O(n) for online scenarios with l = 1. In this work, we extend fairness bounds to general l and focus on the offline version where w_i(t) is known in advance. We introduce an ideal fairness criterion, ensuring |E_i ... 16:00 - 17:00 Mathematics Colloquium Shelah's Black Boxes School MATHEMATICS Black Box principles, introduced by Saharon Shelah, are prediction principles provable within standard mathematics (ZFC). In this talk, we review the history of their development and explore some of their applications. Subscribing the Mathematics Colloquium mailing list: https://groups.google.com/g/ipm-math-colloquium Venue: Niavaran, Lecture Hall 1 ... |