Cover Image

Combinatorial Philosopher Inequalities

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sun, Enze, Tang, Zhihao Gavin, Wang, Yifan
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Stochastic Matching with Unknown Arrival Order: Beating $0.5$ against the Online Optimum
by: Sun, Enze, et al.
Published: (2025)

Sample-Based Matroid Prophet Inequalities
by: Fu, Hu, et al.
Published: (2024)

Online Matching: A Brief Survey
by: Huang, Zhiyi, et al.
Published: (2024)

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling
by: Braverman, Mark, et al.
Published: (2024)

Multi-Unit Combinatorial Prophet Inequalities
by: Chawla, Shuchi, et al.
Published: (2025)

Optimal Competitive Ratio of Two-sided Online Bipartite Matching
by: Tang, Zhihao Gavin
Published: (2026)

Online Flow Time Minimization: Tight Bounds for Non-Preemptive Algorithms
by: Geng, Yutong, et al.
Published: (2025)

Edge-weighted Matching in the Dark
by: Huang, Zhiyi, et al.
Published: (2025)

Setting Targets is All You Need:Improved Order Competitive Ratio for Online Selection
by: Chen, Liyan, et al.
Published: (2024)

Revisiting Ranking for Online Bipartite Matching with Random Arrivals: the Primal-Dual Analysis
by: Peng, Bo, et al.
Published: (2025)

Combinatorial Stationary Prophet Inequalities
by: Patel, Neel, et al.
Published: (2023)

Optimal Pricing with Unreliable Signals
by: Tang, Zhihao Gavin, et al.
Published: (2026)

Combinatorial Correlation Clustering
by: Cohen-Addad, Vincent, et al.
Published: (2024)

Combinatorial Selection with Costly Information
by: Chawla, Shuchi, et al.
Published: (2024)

Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms
by: Ezra, Tomer, et al.
Published: (2024)

Additively Competitive Secretaries
by: Mahdian, Mohammad, et al.
Published: (2026)

Combinatorial Optimization using Comparison Oracles
by: Cohen-Addad, Vincent, et al.
Published: (2025)

Faster Combinatorial k-Clique Algorithms
by: Abboud, Amir, et al.
Published: (2024)

Lookback Prophet Inequalities
by: Benomar, Ziyad, et al.
Published: (2024)

New Algorithm for Combinatorial $n$-folds and Applications
by: Jansen, Klaus, et al.
Published: (2024)

Improved Combinatorial Approximations for Weighted Correlation Clustering
by: Ostovari, Mojtaba, et al.
Published: (2023)

Prophet Inequalities over Time
by: Abels, Andreas, et al.
Published: (2022)

When to Identify Is to Control: On the Controllability of Combinatorial Optimization Problems
by: Klimm, Max, et al.
Published: (2026)

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
by: Mendoza-Cadena, Mirabel, et al.
Published: (2026)

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms
by: Abboud, Amir, et al.
Published: (2023)

Prophet Secretary and Matching: the Significance of the Largest Item
by: Chen, Ziyun, et al.
Published: (2024)

A Bicriterion Concentration Inequality and Prophet Inequalities for $k$-Fold Matroid Unions
by: Alon, Noga, et al.
Published: (2024)

Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs
by: Bernstein, Aaron, et al.
Published: (2025)

Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
by: Chalermsook, Parinya, et al.
Published: (2021)

New Prophet Inequalities via Poissonization and Sharding
by: Harb, Elfarouk
Published: (2023)

A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma
by: Gupta, Sushmita, et al.
Published: (2025)

Stochastic Minimum Spanning Trees with a Single Sample
by: Hoeksma, Ruben, et al.
Published: (2024)

The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis
by: Kuszmaul, William, et al.
Published: (2021)

Maximum Bipartite Matching in $n^{2+o(1)}$ Time via a Combinatorial Algorithm
by: Chuzhoy, Julia, et al.
Published: (2024)

A Combinatorial Characterization of Constant Mixing Time
by: Lau, Lap Chi, et al.
Published: (2025)

Breaking Barriers: Combinatorial Algorithms for Non-monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation
by: Chen, Yixin, et al.
Published: (2025)

Stochastic Online Correlated Selection
by: Chen, Ziyun, et al.
Published: (2024)

Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
by: Jin, Ce, et al.
Published: (2024)

A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
by: Kuszmaul, William
Published: (2025)

A Strongly Subcubic Combinatorial Algorithm for Triangle Detection with Applications
by: Dumitrescu, Adrian
Published: (2024)