PUBLICATIONS
按年:
年 论文标题 作者 期刊或会议
2020 Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass Chenzi Zhang, Shuguang Hu, Zhihao Tang, T.-H. Hubert Chan: IEEE Trans. Knowl. Data Eng.
2020 Tight Revenue Gaps Among Simple Mechanisms Yaonan Jin, Pinyan Lu, Zhihao Tang, Tao Xiao SIAM J. Comput.
2020 Fully Online Matching Zhiyi Huang, Ning Kang, Zhihao Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu J. ACM
2020 Optimal Budget-Feasible Mechanisms for Additive Valuations Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang ACM Trans. Economics and Comput.
2020 Tight Revenue Gaps Among Simple Mechanisms
Yaonan Jin, Pinyan Lu, Zhihao Tang, Tao Xiao
SIAM J. Comput.
2020 Dichotomy for Holant? Problems on the Boolean Domain. Jin-Yi Cai, Pinyan Lu, Mingji Xia Theory Comput. Syst.
2020 Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit ACM Trans. Algorithms
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 Simultaneous auctions without complements are (almost) efficient Michal Feldman, Hu Fu, Nick Gravin, Brendan Lucier Games Econ. Behav
2020 Approximability of the Eight-Vertex Model Jin-Yi Cai, Tianyu Liu, Pinyan Lu, Jing Yu Computational Complexity Conference 2020
2020 Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio Minming Li, Pinyan Lu, Yuhao Yao, Jialin Zhang IJCAI 2020
2020 On Approximating Degree-Bounded Network Design Problems Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian APPROX/RANDOM 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 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 Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass Chenzi Zhang, Shuguang Hu, Zhihao Gavin Tang, T.-H. Hubert Chan IEEE Transactions on Knowledge and Data Engineering
2020 Bounded Incentives in Manipulating the Probabilistic Serial Rule Zihe Wang, Zhide Wei, Jie Zhang AAAI 2020
2020 Optimal Common Contract with Heterogeneous Agents Shenke Xiao, Zihe Wang, Mengjing Chen, Pingzhong Tang, Xiwang Yang AAAI 2020
2020 Optimized Cost per Mille in Feeds Advertising Pingzhong Tang, Xun Wang, Zihe Wang, Yadong Xu, Xiwang Yang AAMAS 2020
2020 Bayesian Nash Equilibrium in First-Price Auction with Discrete Value Distributions Zihe Wang, Weiran Shen, Song Zuo AAMAS 2020
2020 Inference from Auction Prices Jason D. Hartline, Aleck C. Johnsen, Denis Nekipelov, Zihe Wang SODA 2020
2020 Zeros of ferromagnetic two-spin systems Heng Guo, Jingcheng Liu, Pinyan Lu SODA 2020
2020 Fully Online Matching Zhiyi Huang, Ning Kang, Zhihao Tang, Xiaowei Wu, Yuhao Zhang and Xue Zhu Journal of the ACM 2020
2020 Towards a Better Understanding of Randomized Greedy Matching Zhihao Tang, Xiaowei Wu and Yuhao Zhang STOC 2020
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
上海市杨浦区武东路100号
财经大学信息管理与工程学院6楼
版权所有ITCS@SUFE