Showing 1–20 of 28 results
/ Date/ Name
Jul 9, 2021Preserving Diversity when Partitioning: A Geometric ApproachFeb 6, 2018Strong Algorithms for the Ordinal Matroid Secretary ProblemMay 6, 2024Monotone Randomized ApportionmentFeb 13, 2017How large is your graph?May 23, 2025Posted Pricing and Competition in Large MarketsFeb 27, 2019On the extension complexity of schedulingAug 9, 2021Apportionment with Parity ConstraintsNov 18, 2024Matroid Secretary via Labeling SchemesOct 16, 2024Prophet Upper Bounds for Online Matching and AuctionsNov 21, 2018Breaking symmetries to rescue Sum of Squares in the case of makespan schedulingNov 1, 2023Online Combinatorial Assignment in Independence SystemsJul 16, 2021The Convergence Rates of Blockchain Mining Games: A Markovian ApproachDec 8, 2012Split Scheduling with Uniform Setup TimesOct 5, 2017Skyline Computation with Noisy ComparisonsFeb 16, 2024The Competition Complexity of Prophet InequalitiesFeb 23, 2026Competition Versus Complexity in Multiple-Selection Prophet InequalitiesNov 6, 2025Free-order secretary for two-sided independence systemsOct 4, 2024Proportionality in Multiple Dimensions to Design Electoral SystemsJan 21, 2025A Framework for the Design of Efficient Diversification Algorithms to NP-Hard ProblemsAug 20, 2024Optimal Guarantees for Online Selection Over Time