Noticias en español
Planning Deeply Decarbonized Power Systems
Abstract: The energy transition is reshaping power system planning and operation as renewable penetration increases and electrification expands into sectors such as heating and cooling, making systems more dependent on weather-driven variability and uncertainty. Addressing these challenges requires models that can capture both short-term operational flexibility and long-term uncertainty, supported by suitable solution methods. This presentation examines the challenges of long-term power system planning under uncertainty in the context of the energy transition and explores the use of...
Read MoreOptimal d-Clique Decompositions for Hypergraphs.
Abstract: We determine the optimal constant for the Erdős-Pyber theorem on hypergraphs. Namely, we prove that every n-vertex d-uniform hypergraph H can be written as the union of a family F of complete d-partite hypergraphs such that every vertex of H belongs to at most (n choose d)/(n lg n) graphs in F. This improves on results of Csirmaz, Ligeti, and Tardos (2014), and answers an old question of Chung, Erdős, and Spencer (1983). Our proofs yield several algorithmic consequences, such as an O(n lg n) algorithm to find large balanced bicliques near the Kővári-Sós-Turán threshold. Moreover,...
Read MoreColumn Generation and the Feature Selection Problem.
Abstract: Column generation is a well-known decomposition method to solve linear and mixed integer problems with a large number of variables. A similar column generation decomposition method can be constructed for conic optimization problems. In this talk we present work that explores whether this can be a competitive solution method for the continuous relaxation of the feature selection problem.
Read MoreProphet Inequalities with Moment Knowledge.
Abstract: In this talk, we study a variant of the prophet inequality with limited information, where the decision maker only has access to the first k moments of each random variable, rather than their full distributions. Our main result is that, for any k, even one dependent on n, the best possible competitive ratio is Θ(1/ log(n)), which we show can already be achieved with knowledge of the first moment only. Our result implies that the moments are not very informative in this setting, so extra information is needed if one aims for better guarantees. To showcase the impact of extra...
Read MoreFingerprinting Techniques for Lower Bounds in Differential Privacy and a New Fingerprinting Lemm.
Abstract: Analyzing sensitive data presents a fundamental dilemma: how can we extract population-level insights while protecting individual privacy? Differential Privacy (DP) provides a rigorous mathematical framework to address this challenge, offering formal guarantees against sensitive data exposure. Beyond its widespread adoption in practice, DP has revealed surprising connections to various fields like online learning, machine learning generalization, and robust statistics. In this talk, I’ll provide a brief introduction to the core ideas of differential privacy. I will then give...
Read MoreStrategyproof mechanisms without money for independence systems.
Abstract: We consider mechanisms without money for combinatorial independence systems. We are given an independence system where the ground set of items is partitioned into sets owned by strategic agents. Each item has a weight that is the private information of the agent owning it. A mechanism takes an independence system, the weights, and the partitioning as input and returns an independent set; it is strategyproof if no agent can increase the total weight of their items in the solution by reporting lower weights of their items to the mechanism or withholding a subset of their items from...
Read More