| 年 | 论文标题 | 作者 | 期刊或会议 |
|---|---|---|---|
| 2018 | Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems | Heng Guo, Pinyan Lu | TOCT 2018 |
| 2018 | A Simple Mechanism for a Budget-Constrained Buyer | Yu Cheng, Nick Gravin, Kamesh Munagala and Kangning Wang | WINE 2018 |
| 2018 | An improved welfare guarantee for first-price auctions | Darrell Hoy, Sam Taggart, Zihe Wang | SIGecom Exchanges |
| 2018 | Ex-post IR Dynamic Auctions with Cost-per-action Payments | Weiran Shen, Zihe Wang, Song Zuo | AAMAS 2018 |
| 2018 | Ex-post IR Dynamic Auctions with Cost-per-Action Payments | Weiran Shen, Zihe Wang, Song Zuo | IJCAI 2018 |
| 2018 | A tighter welfare guarantee for first-price auctions | Darrell Hoy, Samuel Taggart, Zihe Wang | STOC 2018 |
| 2018 | Facility Location Games With Fractional Preferences | Chi Kit Ken Fong, Minming Li, Pinyan Lu, Taiki Todo, Makoto Yokoo | AAAI 2018 |
| 2018 | Testing Symmetric Markov Chains From a Single Trajectory | Constantinos Daskalakis, Nishanth Dikkala, and Nick Gravin | COLT 2018 |
| 2018 | Counting hypergraph colourings in the local lemma regime | Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang | STOC 2018 |
| 2018 | On the Parameterized Complexity of Approximating Dominating Set | Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi | STOC 2018 |
| 2018 | The Value of Information Concealment | Hu Fu, Chris Liaw, Pinyan Lu and Zhihao Gavin Tang | SODA 2018 |
| 2018 | On the Complexity of Closest Pair via Polar-Pair of Point-Sets | Roee David, Karthik C. S., Bundit Laekhanukit | SoCG 2018 |
| 2018 | Survivable Network Design for Group Connectivity in Low-Treewidth Graphs | Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz | APPROX-RANDOM 2018 |
| 2018 | Dichotomy for Real Holant^c Problems | Jin-Yi Cai, Pinyan Lu and Mingji Xia | SODA 2018 |
| 2018 | Separation in Correlation-Robust Monopolist Problem with Budget | Nick Gravin and Pinyan Lu | SODA 2018 |
