60 citations · 237 across the 39 of their papers we have counts for
7 papers · 1 filter
Competitive Auctions for Markets with Positive Externalities
Nick Gravin, Pinyan Lu
In digital goods auctions, there is an auctioneer who sells an item with unlimited supply to a set of potential buyers, and the objective is to design truthful auction to maximize…
Budget Feasible Mechanism Design via Random Sampling
Xiaohui Bei, Ning Chen, Nick Gravin +1
Budget feasible mechanism considers algorithmic mechanism design questions where there is a budget constraint on the total payment of the mechanism. An important question in the fi…
Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin +1
We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existenc…
The inverse moment problem for convex polytopes
Nick Gravin, Jean Lasserre, Dmitrii Pasechnik +1
The goal of this paper is to present a general and novel approach for the reconstruction of any convex d-dimensional polytope P, from knowledge of its moments. In particular, we sh…
Mechanism Design without Money via Stable Matching
Ning Chen, Nick Gravin, Pinyan Lu
Mechanism design without money has a rich history in social choice literature. Due to the strong impossibility theorem by Gibbard and Satterthwaite, exploring domains in which ther…
Efficient computation of approximate pure Nash equilibria in congestion games
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin +1
Congestion games constitute an important class of games in which computing an exact or even approximate pure Nash equilibrium is in general {\sf PLS}-complete. We present a surpris…