Year |
Title |
Author |
Venue |
2023 |
"Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online Settings |
Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang |
SODA 2023 |
2023 |
Bidder Subset Selection Problem in Auction Design |
Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang |
SODA 2023 |
2023 |
The Price of Stability for First Price Auction |
Yaonan Jin, Pinyan Lu |
SODA 2023 |
2023 |
Learning Reserve Prices in Second-Price Auctions |
Yaonan Jin, Pinyan Lu, Tao Xiao |
ITCS 2023 |
2022 |
Optimal Prophet Inequality with Less than One Sample |
Nick Gravin, Hao Li, Zhihao Gavin Tang |
WINE 2022 |
2022 |
Lookahead Auctions with Pooling |
Michal Feldman, Nick Gravin, Zhihao Gavin Tang, Almog Wald |
SAGT 2022 |
2022 |
Online Facility Location with Predictions |
Shaofeng H.-C. Jiang, Erzhi Liu, You Lyu, Zhihao Gavin Tang, Yubo Zhang |
ICLR 2022 |
2022 |
Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design |
Bo Peng, Zhihao Gavin Tang |
FOCS 2022 |
2022 |
The online food delivery problem on stars |
Xiangyu Guo, Kelin Luo, Zhihao Gavin Tang, Yuhao Zhang |
Theoretical Computer Science |
2022 |
Prophet Matching with General Arrivals |
Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang |
Mathematics of Operations Research |
2022 |
Survivable Network Design Revisited: Group-Connectivity |
Qingyun Chen, Bundit Laekhanukit, Chao Liao, Yuhao Zhang |
FOCS 2022 |
2022 |
Better Approximation for Interdependent SOS Valuations |
Pinyan Lu, Enze Sun, Chenghan Zhou |
WINE 2022 |
2022 |
PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set Problem |
Yuming Du, Qingyun Zhang, Junzhou Xu, Shungen Zhang, Chao Liao, Zhihuai Chen, Zhibo Sun, Zhouxing Su, Junwen Ding, Chen Wu, Pinyan Lu, Zhi-Peng Lv |
IPEC 2022 |
2022 |
Bayesian Auctions with Efficient Queries (Extended Abstract) |
Jing Chen, Bo Li, Yingkai Li, Pinyan Lu |
IJCAI 2022 |
2022 |
First Price Auction is 1 - 1 /e2 Efficient |
Yaonan Jin, Pinyan Lu |
FOCS 2022 |
2022 |
Tight Revenue Gaps among Multiunit Mechanisms |
Yaonan Jin, Shunhua Jiang, Pinyan Lu, and Hengjie Zhang |
SIAM Journal on Computing 2022 |
2022 |
Stability of Decentralized Queueing Networks Beyond Complete Bipartite Cases |
Hu Fu, Qun Hu, Jia nan Lin |
WINE 2022 |
2022 |
M-Mix: Generating Hard Negatives via Multi-sample Mixing for Contrastive Learning |
Shaofeng Zhang, Meng Liu, Junchi Yan, Hengrui Zhang, Lingxiao Huang, Xiaokang Yang, Pinyan Lu |
KDD 2022 |
2022 |
Bayesian auctions with efficient queries |
Jing Chen, Bo Li, Yingkai Li, Pinyan Lu |
Artificial Intelligence |
2022 |
An FPTAS for the hardcore model on random regular bipartite graphs |
Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao |
Theoretical Computer Science |
2022 |
Transparency and Control in Platforms for Networked Markets |
John Z. F. Pang, Weixuan Lin, Hu Fu, Jack Kleeman, Eilyan Bitar, Adam Wierman |
Operations Research |
2022 |
On Approximating Degree-Bounded Network Design Problems |
Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian |
Algorithmica |
2022 |
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity |
Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang |
ICALP 2022 |
2022 |
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree |
Shi Li, Bundit Laekhanukit |
SODA 2022 |
2022 |
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods |
Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz |
SWAT 2022 |
2022 |
Mechanism Design with Predictions |
Chenyang Xu, Pinyan Lu |
IJCAI 2022 |
2022 |
General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching |
Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang |
EC 2022 |
2022 |
Bayesian and Randomized Clock Auctions |
Michal Feldman, Vasilis Gkatzelis, Nick Gravin, Daniel Schoepflin |
EC 2022 |
2022 |
(Fractional) online stochastic matching via fine-grained offline statistics |
Zhihao Gavin Tang, Jinzhao Wu, Hongxun Wu |
STOC 2022 |
2022 |
Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues |
Tsz Chiu Kwok, Lap Chi Lau, Kam Chuen Tung |
FOCS 2022 |
2022 |
Oblivious Online Contention Resolution Schemes |
Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang |
SOSA 2022 |
2021 |
Online Stochastic Matching with Edge Arrivals |
Nick Gravin, Zhihao Gavin Tang, Kangning Wang |
ICALP 2021 |
2021 |
Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications |
Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang |
ICALP 2021 |
2021 |
Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem |
Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang, Xinzhi Zhang |
COLT 2021 |
2021 |
Tight Revenue Gaps among Multi-Unit Mechanisms |
Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang |
EC 2021 |
2021 |
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores |
Xin Huang, Pinyan Lu |
EC 2021 |
2021 |
Online Selection Problems against Constrained Adversary |
Zhihao Jiang, Pinyan Lu, Zhihao Gavin Tang, Yuhao Zhang |
ICML 2021 |
2021 |
Zeros of Holant Problems: Locations and Algorithms |
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang |
ACM Trans. Algorithms |
2021 |
Vertex Sparsification for Edge Connectivity |
Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz |
SODA 2021 |
2021 |
Concentration bounds for almost k-wise independence with applications to non-uniform security |
Nick Gravin, Siyao Guo, Tsz Chiu Kwok, Pinyan Lu |
SODA 2021 |
2021 |
Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler |
Zhengfeng Ji, Zhihan Jin, Pinyan Lu |
SODA 2021 |
2021 |
Generalized Sorting with Predictions |
Pinyan Lu, Xuandi Ren, Enze Sun, Yubo Zhang |
SOSA 2021 |
2020 |
Optimized Cost per Mille in Feeds Advertising |
Shenke Xiao, Zihe Wang, Mengjing Chen, Pingzhong Tang, Xiwang Yang |
AAMAS 2020 |
2020 |
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs |
Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, Yuhao Zhang |
APPROX/RANDOM 2020 |
2020 |
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More |
Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan |
SIAM J. Comput |
2020 |
Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models |
Tomer Ezra, Michal Feldman, Nick Gravin and Zhihao Tang |
EC 2020 |
2020 |
Tight Revenue Gaps Among Simple Mechanisms |
Yaonan Jin, Pinyan Lu, Zhihao Tang, Tao Xiao |
SIAM J. Comput. |
2020 |
Bayesian Nash Equilibrium in First-Price Auction with Discrete Value Distributions |
Zihe Wang, Weiran Shen, Song Zuo |
AAMAS 2020 |
2020 |
Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting |
Sorrachai Yingchareonthawornchai, Proteek Chandan Roy, Bundit Laekhanukit, Eric Torng, Kalyanmoy Deb |
GECCO Companion 2020 |
2020 |
Simultaneous auctions without complements are (almost) efficient |
Michal Feldman, Hu Fu, Nick Gravin, Brendan Lucier |
Games Econ. Behav |