Related papers: A Geometric Analysis of Gains from Trade
Randomized mechanisms, which map a set of bids to a probability distribution over outcomes rather than a single outcome, are an important but ill-understood area of computational mechanism design. We investigate the role of randomized…
We obtain revenue guarantees for the simple pricing mechanism of a single posted price, in terms of a natural parameter of the distribution of buyers' valuations. Our revenue guarantee applies to the single item n buyers setting, with…
We study the problem of computing maximin share guarantees, a recently introduced fairness notion. Given a set of $n$ agents and a set of goods, the maximin share of a single agent is the best that she can guarantee to herself, if she would…
We propose a truthful-in-expectation, $(1-1/e)$-approximation mechanism for a strategic variant of the generalized assignment problem (GAP). In GAP, a set of items has to be optimally assigned to a set of bins without exceeding the capacity…
In this paper we consider the Stochastic Matching problem, which is motivated by applications in kidney exchange and online dating. We are given an undirected graph in which every edge is assigned a probability of existence and a positive…
We present a 1.91457-approximation algorithm for the prize-collecting travelling salesman problem. This is obtained by combining a randomized variant of a rounding algorithm of Bienstock et al. and a primal-dual algorithm of Goemans and…
In this note we present a refinement of the AM-GM inequality, and then we estimate in a special case the typical size of the improvement.
We present a new approximation algorithm for the (metric) prize-collecting traveling salesperson problem (PCTSP). In PCTSP, opposed to the classical traveling salesperson problem (TSP), one may not include a vertex of the input graph in the…
This paper analyzes key properties of networks generated by geometric preferential attachment. We establish that the expected number of triangles is proportional to that of the standard preferential attachment model, with a proportionality…
We address the problem of maximizing Gain from Trade (GFT) in repeated buyer-seller exchanges subject to global budget balance constraints. While this problem is well-understood in purely adversarial and stochastic settings, these…
We study the problem of design of strategyproof in expectation (SP) mechanisms for facility location on a cycle, with the objective of minimizing the sum of costs of $n$ agents. We show that there exists an SP mechanism that attains an…
New fairness notions aligned with the merit principle are proposed for designing exchange rules. We show that for an obviously strategy-proof, efficient and individually rational rule, (i) an agent receives her favorite object when others…
Travelling Salesman Problem (TSP) is one of the unsolved problems in computer science. TSP is NP Hard. Till now the best approximation ratio found for symmetric TSP is three by two by Christofides Algorithm more than forty years ago. There…
An algorithm was recently introduced by INTECH for the purposes of estimating the trading-profit contribution of systematic rebalancing to the relative return of rules-based investment strategies. We apply this methodology to analyze the…
We develop a new formulation of Stein's method to obtain computable upper bounds on the total variation distance between the geometric distribution and a distribution of interest. Our framework reduces the problem to the construction of a…
We consider a dynamic mechanism design problem where an auctioneer sells an indivisible good to groups of buyers in every round, for a total of $T$ rounds. The auctioneer aims to maximize their discounted overall revenue while adhering to a…
We propose a combinatorial ascending auction that is "approximately" optimal, requiring minimal rationality to achieve this level of optimality, and is robust to strategic and distributional uncertainties. Specifically, the auction is…
Impartial selection has recently received much attention within the multi-agent systems community. The task is, given a directed graph representing nominations to the members of a community by other members, to select the member with the…
The vertex cover problem is a famous combinatorial problem, and its complexity has been heavily studied. While a 2-approximation can be trivially obtained for it, researchers have not been able to approximate it better than 2-\textit{o}(1).…
We propose a class of subspace ascent methods for computing optimal approximate designs that covers both existing as well as new and more efficient algorithms. Within this class of methods, we construct a simple, randomized exchange…