60 citations · 237 across the 39 of their papers we have counts for
5 papers · 1 filter
Combinatorial Auctions via Posted Prices
Michal Feldman, Nick Gravin, Brendan Lucier
We study anonymous posted price mechanisms for combinatorial auctions in a Bayesian framework. In a posted price mechanism, item prices are posted, then the consumers approach the…
The inverse moment problem for convex polytopes: implementation aspects
Nick Gravin, Danny Nguyen, Dmitrii Pasechnik +1
We give a detailed technical report on the implementation of the algorithm presented in Gravin et al. (Discrete & Computational Geometry'12) for reconstructing an -vertex convex…
Towards Optimal Algorithms for Prediction with Expert Advice
Nick Gravin, Yuval Peres, Balasubramanian Sivan
We study the classical problem of prediction with expert advice in the adversarial setting with a geometric stopping time. In 1965, Cover gave the optimal algorithm for the case of…
Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin
We present an algorithm that computes approximate pure Nash equilibria in a broad class of constraint satisfaction games that generalize the well-known cut and party affiliation ga…
Optimal Competitive Auctions
Ning Chen, Nick Gravin, Pinyan Lu
We study the design of truthful auctions for selling identical items in unlimited supply (e.g., digital goods) to n unit demand buyers. This classic problem stands out from profit-…