Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Hengjie Zhang
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
PDF
Chat
Tight Revenue Gaps among Multiunit Mechanisms
2022
Yaonan Jin
Shunhua Jiang
Pinyan Lu
Hengjie Zhang
+
Tight Revenue Gaps among Multi-Unit Mechanisms
2021
Yaonan Jin
Shunhua Jiang
Pinyan Lu
Hengjie Zhang
+
Tight Revenue Gaps among Multi-Unit Mechanisms
2021
Yaonan Jin
Shunhua Jiang
Pinyan Lu
Hengjie Zhang
+
Space-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matching
2020
S. Cliff Liu
Zhao Song
Hengjie Zhang
Common Coauthors
Coauthor
Papers Together
Shunhua Jiang
3
Pinyan Lu
3
Yaonan Jin
3
S. Cliff Liu
1
Zhao Song
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
PDF
Chat
Optimal competitive auctions
2014
Ning Chen
Nick Gravin
Pinyan Lu
3
+
PDF
Chat
Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers
2014
Saeed Alaei
3
+
PDF
Chat
Separation between second price auctions with personalized reserves and the revenue optimal auction
2020
Will Ma
Balasubramanian Sivan
3
+
PDF
Chat
Tight Revenue Gaps Among Simple Mechanisms
2020
Yaonan Jin
Pinyan Lu
Zhihao Gavin Tang
Tao Xiao
3
+
PDF
Chat
Optimal auctions vs. anonymous pricing
2018
Saeed Alaei
Jason D. Hartline
Rad Niazadeh
Emmanouil Pountourakis
Yuan Yang
3
+
Learning Reserve Prices in Second-Price Auctions
2019
Yaonan Jin
Pinyan Lu
Tao Xiao
2
+
Revenue Gaps for Static and Dynamic Posted Pricing of Homogeneous Goods
2016
Paul Dütting
Felix Fischer
Max Klimm
2
+
PDF
Chat
Optimal Pricing for MHR Distributions
2018
Yiannis Giannakopoulos
Kèyù Zhü
2
+
On the approximability of budget feasible mechanisms
2011
Ning Chen
Nick Gravin
Pinyan Lu
2
+
Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures
2011
Oliver Johnson
Ioannis Kontoyiannis
Mokshay Madiman
2
+
PDF
Chat
Optimal Budget-Feasible Mechanisms for Additive Valuations
2020
Nick Gravin
Yaonan Jin
Pinyan Lu
Chenhao Zhang
2
+
PDF
Chat
Randomization Beats Second Price as a Prior-Independent Auction
2015
Hu Fu
Nicole Immorlica
Brendan Lucier
Philipp Strack
2
+
Mechanism Design via Correlation Gap
2010
Qiqi Yan
2
+
PDF
Chat
Budget Feasible Mechanisms
2010
Yaron Singer
2
+
PDF
Chat
Tight approximation ratio of anonymous pricing
2019
Yaonan Jin
Pinyan Lu
Qi Qi
Zhihao Gavin Tang
Tao Xiao
2
+
PDF
Chat
Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets
2014
Nima Anari
Gagan Goel
Afshin Nikzad
2
+
PDF
Chat
Random Order Contention Resolution Schemes
2018
Marek Adamczyk
Michał Włodarczyk
2
+
PDF
Chat
Competitive Analysis via Benchmark Decomposition
2015
Ning Chen
Nick Gravin
Pinyan Lu
2
+
Improved Approximations for Free-Order Prophets and Second-Price Auctions.
2018
Hedyeh Beyhaghi
Negin Golrezaei
Renato Paes Leme
Martin Pál
Balasubramanian Sivan
2
+
PDF
Chat
Learning Multi-Item Auctions with (or without) Samples
2017
Yang Cai
Constantinos Daskalakis
2
+
PDF
Chat
Prophet Secretary for Combinatorial Auctions and Matroids
2018
Soheil Ehsani
MohammadTaghi Hajiaghayi
Thomas Keßelheim
Sahil Singla
2
+
Prophet secretary through blind strategies
2019
José R. Correa
Raimundo Saona
Bruno Ziliotto
2
+
PDF
Chat
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
2011
Kook Jin Ahn
Sudipto Guha
1
+
Optimal Budget-Feasible Mechanisms for Additive Valuations
2019
Nick Gravin
Yaonan Jin
Pinyan Lu
Chenhao Zhang
1
+
Distributed and Streaming Linear Programming in Low Dimensions
2019
Sepehr Assadi
Nikolai Karpov
Qin Zhang
1
+
Dynamic Streaming Spectral Sparsification in Nearly Linear Time and Space.
2019
Michael Kapralov
Navid Nouri
Aaron Sidford
Jakab Tardos
1
+
Faster Spectral Sparsification in Dynamic Streams.
2019
Michael Kapralov
Aida Mousavifar
Cameron Musco
Christopher Musco
Navid Nouri
1
+
Solving Empirical Risk Minimization in the Current Matrix Multiplication Time
2019
Yin Tat Lee
Song Zhao
Qiuyi Zhang
1
+
PDF
Chat
Prophet Secretary Through Blind Strategies
2019
José R. Correa
Raimundo Saona
Bruno Ziliotto
1
+
PDF
Chat
Mechanism Design via Correlation Gap
2011
Qiqi Yan
1
+
PDF
Chat
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
2015
Yin Tat Lee
Aaron Sidford
Sam Chiu-wai Wong
1
+
PDF
Chat
Solving linear programs in the current matrix multiplication time
2019
Michael B. Cohen
Yin Tat Lee
Zhao Song
1
+
PDF
Chat
Computing Maximum Flow with Augmenting Electrical Flows
2016
Aleksander Mądry
1
+
PDF
Chat
Parallel Reachability in Almost Linear Work and Square Root Depth
2019
Yang P. Liu
Arun Jambulapati
Aaron Sidford
1
+
A Deterministic Linear Program Solver in Current Matrix Multiplication Time
2019
Jan van den Brand
1
+
PDF
Chat
Approximate Maximum Matching in Random Streams
2019
Alireza Farhadi
Mohammad Taghi Hajiaghayi
Tung Mah
Anup Rao
Ryan A. Rossi
1
+
Faster Divergence Maximization for Faster Maximum Flow
2020
Yang P. Liu
Aaron Sidford
1
+
Faster Dynamic Matrix Inverse for Faster LPs
2020
Shunhua Jiang
Zhao Song
Omri Weinstein
Hengjie Zhang
1
+
PDF
Chat
Solving tall dense linear programs in nearly linear time
2020
Jan van den Brand
Yin Tat Lee
Aaron Sidford
Zhao Song
1
+
PDF
Chat
Faster energy maximization for faster maximum flow
2020
Yang P. Liu
Aaron Sidford
1
+
PDF
Chat
Tight Distributed Sketching Lower Bound for Connectivity
2021
Huacheng Yu
1
+
Solving Tall Dense SDPs in the Current Matrix Multiplication Time.
2021
Baihe Huang
Shunhua Jiang
Zhao Song
Runzhou Tao
1
+
PDF
Chat
A Faster Interior Point Method for Semidefinite Programming
2020
Haotian Jiang
Tarun Kathuria
Yin Tat Lee
Swati Padmanabhan
Zhao Song
1
+
PDF
Chat
Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms
2020
Sepehr Assadi
Ran Raz
1
+
PDF
Chat
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems
2020
Sepehr Assadi
Gillat Kol
Raghuvansh R. Saxena
Huacheng Yu
1
+
PDF
Chat
A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path
2021
Sally Dong
Yin Tat Lee
Guanghao Ye
1
+
PDF
Chat
Graph Sparsification in the Semi-streaming Model
2009
Kook Jin Ahn
Sudipto Guha
1
+
PDF
Chat
Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms
2021
Hedyeh Beyhaghi
Negin Golrezaei
Renato Paes Leme
Martin Pál
Balasubramanian Sivan
1
+
PDF
Chat
Efficient Inverse Maintenance and Faster Algorithms for Linear Programming
2015
Yin Tat Lee
Aaron Sidford
1
+
PDF
Chat
Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
2014
Daniel A. Spielman
Shang‐Hua Teng
1