Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations -- Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria -- Limiting Price Discrimination when Selling Products with Positive Network Externalities -- Computing Approximate Nash Equilibria in Polymatrix Games -- Optimal Cost-Sharing in Weighted Congestion Games -- Truthful Multi-unit Procurements with Budgets -- The Shapley Value in Knapsack Budgeted Games -- Fast Convex Decomposition for Truthful Social Welfare Approximation -- A Near-Optimal Mechanism for Impartial Selection -- Value-based Network Externalities and Optimal Auction Design -- Matching Dynamics with Constraints -- Truthful Approximations to Range Voting -- Resource Competition on Integral Polymatroids -- PTAS for Minimax Approval Voting -- Biobjective Online Bipartite Matching -- Dynamic Reserve Prices for Repeated Auctions: Learning from Bids.