2 citations · 5 across the 4 of their papers we have counts for
5 papers
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…
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…
Translational tilings by a polytope, with multiplicity
Nick Gravin, Sinai Robins, Dmitry Shiryaev
We study the problem of covering R^d by overlapping translates of a convex body P, such that almost every point of R^d is covered exactly k times. Such a covering of Euclidean spac…
Dynamics of Profit-Sharing Games
John Augustine, Ning Chen, Edith Elkind +3
An important task in the analysis of multiagent systems is to understand how groups of selfish players can form coalitions, i.e., work together in teams. In this paper, we study th…