Zhihao Gavin Tang

Quan Xue

Theor. Comput. Sci., February, 2024

Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms.

[BibT_eX]

[DOI]

Tomer Ezra

Michal Feldman

CoRR, 2024

Incentives for Early Arrival in Cooperative Games.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Toward a Better Understanding of Randomized Greedy Matching.

[BibT_eX]

[DOI]

J. ACM, December, 2023

Online resource allocation in Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the ACM Web Conference 2023, 2023

"Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online Settings.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Bidder Subset Selection Problem in Auction Design.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity.

[BibT_eX]

[DOI]

Enze Sun

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

The online food delivery problem on stars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Prophet Matching with General Arrivals.

[BibT_eX]

[DOI]

Math. Oper. Res., 2022

The Cardinal Complexity of Comparison-based Online Algorithms.

[BibT_eX]

[DOI]

Enze Sun

CoRR, 2022

On the Significance of Knowing the Arrival Order in Prophet Inequality.

[BibT_eX]

[DOI]

CoRR, 2022

Improved Bounds for Fractional Online Matching Problems.

[BibT_eX]

[DOI]

CoRR, 2022

Optimal Prophet Inequality with Less than One Sample.

[BibT_eX]

[DOI]

Hao Li

Proceedings of the Web and Internet Economics - 18th International Conference, 2022

(Fractional) online stochastic matching via fine-grained offline statistics.

[BibT_eX]

[DOI]

Jinzhao Wu

Hongxun Wu

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Oblivious Online Contention Resolution Schemes.

[BibT_eX]

[DOI]

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Lookahead Auctions with Pooling.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Online Facility Location with Predictions.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Conference on Learning Representations, 2022

Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design.

[BibT_eX]

[DOI]

Bo Peng

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Online Selection Problems against Constrained Adversary.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Online Stochastic Matching with Edge Arrivals.

[BibT_eX]

[DOI]

Kangning Wang

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

2020

Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2020

Tight Revenue Gaps Among Simple Mechanisms.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Fully Online Matching.

[BibT_eX]

[DOI]

J. ACM, 2020

Secretary Matching with General Arrivals.

[BibT_eX]

[DOI]

CoRR, 2020

A Simple 1-1/e Approximation for Oblivious Bipartite Matching.

[BibT_eX]

[DOI]

CoRR, 2020

Towards a better understanding of randomized greedy matching.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models.

[BibT_eX]

[DOI]

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Fully Online Matching II: Beating Ranking and Water-filling.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Diffusion operator and spectral analysis for directed hypergraph Laplacian.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Online Vertex-Weighted Bipartite Matching: Beating 1-1/<i>e</i> with Random Arrivals.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Tight revenue gaps among simple and optimal mechanisms.

[BibT_eX]

[DOI]

SIGecom Exch., 2019

Perturbed Greedy on Oblivious Matching Problems.

[BibT_eX]

[DOI]

CoRR, 2019

Tight approximation ratio of anonymous pricing.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Correlation-Robust Analysis of Single Item Auction.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Online Submodular Maximization with Free Disposal.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Spectral Properties of Hypergraph Laplacian and Approximation Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2018

Monopoly pricing with buyer search.

[BibT_eX]

[DOI]

CoRR, 2018

On (1,ϵ)-Restricted Max-Min Fair Allocation Problem.

[BibT_eX]

[DOI]

Algorithmica, 2018

How to match when all vertices arrive online.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

The Value of Information Concealment.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Online Makespan Minimization: The Power of Restart.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2018

2017

Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Graph Edge Partitioning via Neighborhood Heuristic.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

Online Submodular Maximization Problem with Vector Packing Constraint.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids.

[BibT_eX]

[DOI]

CoRR, 2016

On (1, epsilon)-Restricted Max-Min Fair Allocation Problem.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

Spectral Properties of Laplacian and Stochastic Diffusion Process for Edge Expansion in Hypergraphs.

[BibT_eX]

[DOI]

Chenzi Zhang

CoRR, 2015

Cheeger Inequalities for General Edge-Weighted Directed Graphs.

[BibT_eX]

[DOI]