
Secretary Matching with General Arrivals
We provide online algorithms for secretary matching in general weighted ...
read it

Fully Online Matching II: Beating Ranking and Waterfilling
Karp, Vazirani, and Vazirani (STOC 1990) initiated the study of online b...
read it

Online Stochastic MaxWeight Matching: prophet inequality for vertex and edge arrival models
We provide prophet inequality algorithms for online weighted matching in...
read it

A Simple 11/e Approximation for Oblivious Bipartite Matching
We study the oblivious matching problem, which aims at finding a maximum...
read it

Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem
This paper explores a theory of generalization for learning problems on ...
read it

Online Stochastic Matching with Edge Arrivals
Online bipartite matching with edge arrivals is an important extension o...
read it

Perturbed Greedy on Oblivious Matching Problems
We study the maximum matching problem in the oblivious setting, i.e. the...
read it

Tight Approximation Ratio of Anonymous Pricing
We consider two canonical Bayesian mechanism design settings. In the sin...
read it

Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
Huang et al. (STOC 2018) introduced the fully online matching problem, a...
read it

Online Makespan Minimization: The Power of Restart
We consider the online makespan minimization problem on identical machin...
read it

Online VertexWeighted Bipartite Matching: Beating 11/e with Random Arrivals
We introduce a weighted version of the ranking algorithm by Karp et al. ...
read it

Tight Revenue Gaps among Simple Mechanisms
We consider the simplest and most fundamental problem of selling a singl...
read it

How to Match when All Vertices Arrive Online
We introduce a fully online model of maximum cardinality matching in whi...
read it

Monopoly pricing with buyer search
In many shopping scenarios, e.g., in online shopping, customers have a l...
read it

Diffusion Operator and Spectral Analysis for Directed Hypergraph Laplacian
In spectral graph theory, the Cheeger's inequality gives upper and lower...
read it
Zhihao Gavin Tang
is this you? claim profile