MADlib is a free, open-source library of in-database analytic methods. It provides an evolving suite of SQL-based algorithms for machine learning, data mining and statistics that run at scale withinâ€¦ (More)

We resolve the worst-case price of anarchy (POA) of atomic splittable congestion games. Prior to this work, no tight bounds on the POA in such games were known, even for the simplest non-trivialâ€¦ (More)

A common modeling assumption in the realm of cost sharing is that players persuade each other to jointly submit false bids if none of the members of such a coalition loses utility and at least oneâ€¦ (More)

In a Voronoi game, each of a finite number of players chooses a point in some metric space. The utility of a player is the total measure of all points that are closer to him than to any other player,â€¦ (More)

In the context of scheduling, we study social cost efficiency for a cost-sharing problem in which the service providerâ€™s cost is determined by the makespan of the served agentsâ€™ jobs. For identicalâ€¦ (More)

In the context of general demand cost sharing, we present the first group-strategyproof mechanisms for the metric fault tolerant uncapacitated facility location problem. They are (3L)-budget-balancedâ€¦ (More)

We show exact values for the price of anarchy of weighted and unweighted congestion games with polynomial latency functions. The given values also hold for weighted and unweighted network congestionâ€¦ (More)

We provide a collection of new upper and lower bounds on the price of anarchy for singleton congestion games. In our study, we distinguish between restricted and unrestricted strategy sets, betweenâ€¦ (More)