default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNick Gravin
Nikolai Gravin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c40]Nikolai Gravin
, Yixuan Even Xu, Renfei Zhou:
Bidder Selection Problem in Position Auctions: A Fast and Simple Algorithm via Poisson Approximation. WWW 2024: 89-98- [i38]Nick Gravin, Zhiqi Wang:
On Robustness to k-wise Independence of Optimal Bayesian Mechanisms. CoRR abs/2409.08547 (2024) - 2023
- [j18]Nick Gravin, Hongao Wang:
Prophet Inequality for Bipartite Matching: Merits of Being Simple and Nonadaptive. Math. Oper. Res. 48(1): 38-52 (2023) - [c39]Nick Gravin, Enze Sun, Zhihao Gavin Tang:
Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity. FOCS 2023: 1863-1876 - [c38]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
"Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online Settings. SODA 2023: 3759-3776 - [c37]Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang:
Bidder Subset Selection Problem in Auction Design. SODA 2023: 3788-3801 - [c36]Jianhao Jia, Hao Li, Kai Liu, Ziqi Liu, Jun Zhou, Nikolai Gravin, Zhihao Gavin Tang:
Online resource allocation in Markov Chains. WWW 2023: 3498-3507 - [i37]Nick Gravin, Yixuan Even Xu, Renfei Zhou:
Bidder Selection Problem in Position Auctions via Poisson Approximation. CoRR abs/2306.10648 (2023) - 2022
- [j17]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Prophet Matching with General Arrivals. Math. Oper. Res. 47(2): 878-898 (2022) - [j16]Martin Hoefer, Xujin Chen, Nikolai Gravin, Ruta Mehta:
Introduction to the Special Issue on WINE'20: Part 1. ACM Trans. Economics and Comput. 10(2): 6:1 (2022) - [c35]Michal Feldman, Nick Gravin, Zhihao Gavin Tang, Almog Wald:
Lookahead Auctions with Pooling. SAGT 2022: 60-77 - [c34]Michal Feldman, Vasilis Gkatzelis, Nick Gravin, Daniel Schoepflin:
Bayesian and Randomized Clock Auctions. EC 2022: 820-845 - [c33]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching. EC 2022: 1148-1177 - [c32]Nick Gravin, Hao Li, Zhihao Gavin Tang:
Optimal Prophet Inequality with Less than One Sample. WINE 2022: 115-131 - [i36]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
On the Significance of Knowing the Arrival Order in Prophet Inequality. CoRR abs/2202.09215 (2022) - [i35]Michal Feldman, Vasilis Gkatzelis, Nick Gravin, Daniel Schoepflin:
Bayesian and Randomized Clock Auctions. CoRR abs/2202.09291 (2022) - [i34]Nick Gravin, Enze Sun, Zhihao Gavin Tang:
The Cardinal Complexity of Comparison-based Online Algorithms. CoRR abs/2204.01418 (2022) - [i33]Almog Wald, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Lookahead Auctions with Pooling. CoRR abs/2209.12934 (2022) - [i32]Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang:
Bidder Subset Selection Problem in Auction Design. CoRR abs/2211.10969 (2022) - 2021
- [j15]Yu Cheng, Nick Gravin, Kamesh Munagala, Kangning Wang:
A Simple Mechanism for a Budget-Constrained Buyer. ACM Trans. Economics and Comput. 9(2): 10:1-10:25 (2021) - [c31]Nick Gravin, Zhihao Gavin Tang, Kangning Wang:
Online Stochastic Matching with Edge Arrivals. ICALP 2021: 74:1-74:20 - [c30]Nick Gravin, Siyao Guo, Tsz Chiu Kwok, Pinyan Lu:
Concentration bounds for almost k-wise independence with applications to non-uniform security. SODA 2021: 2404-2423 - [c29]Ioannis Caragiannis, Nick Gravin, Pinyan Lu, Zihe Wang:
Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching. WINE 2021: 131-148 - 2020
- [j14]Michal Feldman, Hu Fu, Nick Gravin, Brendan Lucier:
Simultaneous auctions without complements are (almost) efficient. Games Econ. Behav. 123: 327-341 (2020) - [j13]Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang:
Optimal Budget-Feasible Mechanisms for Additive Valuations. ACM Trans. Economics and Comput. 8(4): 21:1-21:15 (2020) - [c28]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models. EC 2020: 769-787 - [e1]Xujin Chen, Nikolai Gravin, Martin Hoefer, Ruta Mehta:
Web and Internet Economics - 16th International Conference, WINE 2020, Beijing, China, December 7-11, 2020, Proceedings. Lecture Notes in Computer Science 12495, Springer 2020, ISBN 978-3-030-64945-6 [contents] - [i31]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models. CoRR abs/2002.09807 (2020) - [i30]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Secretary Matching with General Arrivals. CoRR abs/2011.01559 (2020)
2010 – 2019
- 2019
- [c27]Nikolai Gravin, Hongao Wang:
Prophet Inequality for Bipartite Matching: Merits of Being Simple and Non Adaptive. EC 2019: 93-109 - [c26]Ioannis Caragiannis, Nick Gravin, Xin Huang:
Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items. EC 2019: 527-545 - [c25]Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang:
Optimal Budget-Feasible Mechanisms for Additive Valuations. EC 2019: 887-900 - [c24]Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang:
Correlation-Robust Analysis of Single Item Auction. SODA 2019: 193-208 - [i29]Ioannis Caragiannis, Nick Gravin, Xin Huang:
Envy-freeness up to any item with high Nash welfare: The virtue of donating items. CoRR abs/1902.04319 (2019) - [i28]Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang:
Optimal Budget-Feasible Mechanisms for Additive Valuations. CoRR abs/1902.04635 (2019) - [i27]Nick Gravin, Hongao Wang:
Prophet inequality for bipartite matching: merits of being simple and non adaptive. CoRR abs/1902.06243 (2019) - [i26]Nick Gravin, Zhihao Gavin Tang, Kangning Wang:
Online Stochastic Matching with Edge Arrivals. CoRR abs/1911.04686 (2019) - 2018
- [j12]Nick Gravin, Pinian Lu:
Correlation-robust mechanism design. SIGecom Exch. 16(2): 45-52 (2018) - [c23]Constantinos Daskalakis, Nishanth Dikkala, Nick Gravin:
Testing Symmetric Markov Chains From a Single Trajectory. COLT 2018: 385-409 - [c22]Nick Gravin, Pinyan Lu:
Separation in Correlation-Robust Monopolist Problem with Budget. SODA 2018: 2069-2080 - [c21]Yu Cheng, Nick Gravin, Kamesh Munagala, Kangning Wang:
A Simple Mechanism for a Budget-Constrained Buyer. WINE 2018: 96-110 - [i25]Nick Gravin, Zhihao Gavin Tang:
Monopoly pricing with buyer search. CoRR abs/1802.02751 (2018) - [i24]Yu Cheng, Nick Gravin, Kamesh Munagala, Kangning Wang:
A Simple Mechanism for a Budget-Constrained Buyer. CoRR abs/1809.05207 (2018) - 2017
- [j11]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin:
Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. Algorithmica 77(4): 1143-1158 (2017) - [j10]Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu:
Worst-Case Mechanism Design via Bayesian Analysis. SIAM J. Comput. 46(4): 1428-1448 (2017) - [c20]Nick Gravin, Yuval Peres, Balasubramanian Sivan:
Tight Lower Bounds for Multiplicative Weights Algorithmic Families. ICALP 2017: 48:1-48:14 - [c19]Yossi Azar, Michal Feldman, Nick Gravin, Alan Roytman:
Liquid Price of Anarchy. SAGT 2017: 3-15 - [i23]Constantinos Daskalakis, Nishanth Dikkala, Nick Gravin:
Testing from One Sample: Is the casino really using a riffle shuffle? CoRR abs/1704.06850 (2017) - 2016
- [j9]Michal Feldman, Nick Gravin, Brendan Lucier:
Combinatorial Walrasian Equilibrium. SIAM J. Comput. 45(1): 29-48 (2016) - [c18]Nick Gravin, Nicole Immorlica, Brendan Lucier, Emmanouil Pountourakis:
Procrastination with Variable Present Bias. EC 2016: 361 - [c17]Nick Gravin, Yuval Peres, Balasubramanian Sivan:
Towards Optimal Algorithms for Prediction with Expert Advice. SODA 2016: 528-547 - [i22]Nick Gravin, Nicole Immorlica, Brendan Lucier, Emmanouil Pountourakis:
Procrastination with variable present bias. CoRR abs/1606.03062 (2016) - [i21]Nick Gravin, Yuval Peres, Balasubramanian Sivan:
Tight Lower Bounds for Multiplicative Weights Algorithmic Families. CoRR abs/1607.02834 (2016) - 2015
- [j8]John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev:
Dynamics of Profit-Sharing Games. Internet Math. 11(1): 1-22 (2015) - [j7]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. ACM Trans. Economics and Comput. 3(1): 2:1-2:32 (2015) - [c16]Ning Chen, Nikolai Gravin, Pinyan Lu:
Competitive Analysis via Benchmark Decomposition. EC 2015: 363-376 - [c15]Michal Feldman, Nick Gravin, Brendan Lucier:
Combinatorial Auctions via Posted Prices. SODA 2015: 123-135 - [i20]Yossi Azar, Michal Feldman, Nick Gravin, Alan Roytman:
Liquid Price of Anarchy. CoRR abs/1511.01132 (2015) - [i19]Michal Feldman, Nick Gravin, Brendan Lucier:
On Welfare Approximation and Stable Pricing. CoRR abs/1511.02399 (2015) - 2014
- [j6]Ning Chen, Nick Gravin, Pinyan Lu:
Truthful Generalized Assignments via Stable Matching. Math. Oper. Res. 39(3): 722-736 (2014) - [c14]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin:
Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. SAGT 2014: 49-60 - [c13]Ning Chen, Nick Gravin, Pinyan Lu:
Optimal competitive auctions. STOC 2014: 253-262 - [i18]Ning Chen, Nick Gravin, Pinyan Lu:
Optimal Competitive Auctions. CoRR abs/1401.0880 (2014) - [i17]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin:
Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games. CoRR abs/1402.3450 (2014) - [i16]Nick Gravin, Yuval Peres, Balasubramanian Sivan:
Towards Optimal Algorithms for Prediction with Expert Advice. CoRR abs/1409.3040 (2014) - [i15]Ning Chen, Nick Gravin, Pinyan Lu:
Competitive analysis via benchmark decomposition. CoRR abs/1411.2079 (2014) - [i14]Michal Feldman, Nick Gravin, Brendan Lucier:
Combinatorial Auctions via Posted Prices. CoRR abs/1411.4916 (2014) - 2013
- [j5]Nick Gravin, Mihail N. Kolountzakis, Sinai Robins, Dmitry Shiryaev:
Structure Results for Multiple Tilings in 3D. Discret. Comput. Geom. 50(4): 1033-1050 (2013) - [c12]Nick Gravin, Pinyan Lu:
Competitive Auctions for Markets with Positive Externalities. ICALP (2) 2013: 569-580 - [c11]Michal Feldman, Nick Gravin, Brendan Lucier:
Combinatorial walrasian equilibrium. STOC 2013: 61-70 - [c10]Michal Feldman, Hu Fu, Nick Gravin, Brendan Lucier:
Simultaneous auctions are (almost) efficient. STOC 2013: 201-210 - [i13]Michal Feldman, Nick Gravin, Brendan Lucier:
Combinatorial Walrasian Equilibrium. CoRR abs/1304.2244 (2013) - 2012
- [j4]Nick Gravin, Sinai Robins, Dmitry Shiryaev:
Translational tilings by a polytope, with multiplicity. Comb. 32(6): 629-649 (2012) - [j3]Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins:
The Inverse Moment Problem for Convex Polytopes. Discret. Comput. Geom. 48(3): 596-621 (2012) - [j2]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Computing approximate pure Nash equilibria in congestion games. SIGecom Exch. 11(1): 26-29 (2012) - [c9]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure. EC 2012: 284-301 - [c8]Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu:
Budget feasible mechanism design: from prior-free to bayesian. STOC 2012: 449-458 - [i12]Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu:
Budget Feasible Mechanism Design: From Prior-Free to Bayesian. CoRR abs/1203.4455 (2012) - [i11]Michal Feldman, Hu Fu, Nick Gravin, Brendan Lucier:
Simultaneous Auctions are (almost) Efficient. CoRR abs/1209.4703 (2012) - 2011
- [j1]Nick Gravin, Ning Chen:
A note on k-shortest paths problem. J. Graph Theory 67(1): 34-37 (2011) - [c7]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. FOCS 2011: 532-541 - [c6]John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev:
Dynamics of Profit-Sharing Games. IJCAI 2011: 37-42 - [c5]Ning Chen, Nick Gravin, Pinyan Lu:
On the Approximability of Budget Feasible Mechanisms. SODA 2011: 685-699 - [i10]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Efficient computation of approximate pure Nash equilibria. CoRR abs/1104.2690 (2011) - [i9]Ning Chen, Nick Gravin, Pinyan Lu:
Mechanism Design without Money via Stable Matching. CoRR abs/1104.2872 (2011) - [i8]Nick Gravin, Jean B. Lasserre, Dmitrii V. Pasechnik, Sinai Robins:
The inverse moment problem for convex polytopes. CoRR abs/1106.5723 (2011) - [i7]Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions. CoRR abs/1107.2248 (2011) - [i6]Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu:
Budget Feasible Mechanism Design via Random Sampling. CoRR abs/1107.2994 (2011) - [i5]Nick Gravin, Pinyan Lu:
Competitive Auctions for Markets with Positive Externalities. CoRR abs/1107.5221 (2011) - 2010
- [c4]Nick Gravin:
Time Optimal d-List Colouring of a Graph. CSR 2010: 156-168 - [c3]Ning Chen, Edith Elkind, Nick Gravin, Fedor Petrov:
Frugal Mechanism Design via Spectral Techniques. FOCS 2010: 755-764 - [c2]John Augustine, Nick Gravin:
On the Continuous CNN Problem. ISAAC (2) 2010: 254-265 - [i4]John Augustine, Nick Gravin:
On the Continuous CNN Problem. CoRR abs/1004.2393 (2010) - [i3]Ning Chen, Nick Gravin, Pinyan Lu:
On the Approximability of Budget Feasible Mechanisms. CoRR abs/1007.3801 (2010) - [i2]John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev:
Dynamics of Profit-Sharing Games. CoRR abs/1010.5081 (2010)
2000 – 2009
- 2009
- [c1]Ning Chen, Edith Elkind, Nick Gravin:
Refining the Cost of Cheap Labor in Set System Auctions. WINE 2009: 447-454 - [i1]Ning Chen, Edith Elkind, Nick Gravin, Fedor Petrov:
Frugal Mechanism Design via Spectral Techniques. CoRR abs/0912.3403 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
