Nick Gravin
机构: ITCS, Shanghai University of Finance and Economics
每年引用次数
引用次数
引用: 1,818
H-指数: 22
I10-指数 : 34
出版物: 79
INCENTIVE COMPATIBLE DESIGN OF REVERSE AUCTIONS
Nikolai. Gravin
2013
Separation in correlation-robust monopolist problem with budget
Pinyan Lu , Nick Graving
symposium on discrete algorithms 2069 -2080
11
2018
On proper colorings of hypergraphs
N. V. Gravin , D. V. Karpov
Journal of Mathematical Sciences 184 ( 5) 595 -600
2012
Abnormal subgroups in classical groups that correspond to closed root sets
N. V. Gravin , D. Yu. Shiryaev
Journal of Mathematical Sciences 161 ( 4) 542 -552
2009
Nondegenerate colourings in the Brooks theorem
N. V. Gravin
Discrete Mathematics and Applications 19 ( 5) 533 -553
2009
Constructing a spanning tree with many leaves
N. Gravin
Journal of Mathematical Sciences 179 ( 5) 592 -600
4
2011
Construction of a spanning tree with many leaves
Nikolay Vadimovich Gravin
Zapiski Nauchnykh Seminarov POMI 381 31 -46
6
2010
Abnormal subgroups of classical groups corresponding to closed sets of roots
Nikolay Vadimovich Gravin , D Yu Shiryaev
Zapiski Nauchnykh Seminarov POMI 365 151 -171
2009
Trees with many leaves
NV Gravin
On the approximability of budget feasible mechanisms
Nick Gravin , Pinyan Lu , Ning Chen
symposium on discrete algorithms 685 -699
84
2011
Testing Symmetric Markov Chains From a Single Trajectory
Nick Gravin , Constantinos Daskalakis , Nishanth Dikkala
conference on learning theory 385 -409
7
2018
Correlation-robust analysis of single item auction
Xiaohui Bei , Nick Gravin , Pinyan Lu , Zhihao Gavin Tang
symposium on discrete algorithms 193 -208
11
2019
Prophet inequality for bipartite matching: merits of being simple and non adaptive.
Nick Gravin , Hongao Wang
arXiv: Computer Science and Game Theory
2019
Combinatorial Walrasian Equilibrium
Brendan Lucier , Nick Gravin , Michal Feldman
arXiv: Computer Science and Game Theory
21
2013
Combinatorial Auctions via Posted Prices
Brendan Lucier , Nick Gravin , Michal Feldman
arXiv: Computer Science and Game Theory
16
2014
Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure
Alexander Skopalik , Ioannis Caragiannis , Nick Gravin , Angelo Fanelli
arXiv: Computer Science and Game Theory
46
2011
Efficient computation of approximate pure Nash equilibria in congestion games
Alexander Skopalik , Ioannis Caragiannis , Nick Gravin , Angelo Fanelli
arXiv: Computer Science and Game Theory
59
2011
Towards optimal algorithms for prediction with expert advice
Balasubramanian Sivan , Nick Gravin , Yuval Peres
symposium on discrete algorithms 528 -547
32
2016
Concentration bounds for almost k-wise independence with applications to non-uniform security
Nick Gravin , Pinyan Lu , Siyao Guo , Tsz Chiu Kwok
symposium on discrete algorithms 2404 -2423
2021
Simultaneous auctions are (almost) efficient
Michal Feldman , Hu Fu , Nick Gravin , Brendan Lucier
Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 201 -210
92
2013