• Publications
  • Influence
Online budgeted matching in random input models with applications to Adwords
TLDR
We study an online assignment problem, motivated by Adwords Allocation, in which queries are to be assigned to bidders with budget constraints. Expand
  • 259
  • 29
Online vertex-weighted bipartite matching and single-bid budgeted allocations
TLDR
We study the following vertex-weighted online bipartite matching problem: G(U, V, E) is a bipartITE graph. Expand
  • 150
  • 17
  • PDF
Budget constrained auctions with heterogeneous items
TLDR
In this paper, we present the first approximation algorithms for the problem of designing revenue optimal Bayesian incentive compatible auctions when there are multiple (heterogeneous) items and when bidders have arbitrary demand and budget constraints. Expand
  • 107
  • 17
  • PDF
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
TLDR
We introduce an algorithmic framework for studying combinatorial problems in the presence of multiple agents with submodular cost functions with tight upper and lower bounds for the approximability of these problems. Expand
  • 73
  • 10
  • PDF
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
  • D. Chakrabarty, G. Goel
  • Mathematics, Computer Science
  • 49th Annual IEEE Symposium on Foundations of…
  • 25 October 2008
TLDR
We give a 3/4-approximation algorithm for MBA improving upon the previous best of sime0.632 and improve upon the best known approximation and hardness of approximation factors. Expand
  • 61
  • 9
  • PDF
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
TLDR
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of $m$ indivisible items and $n$ agents, with each agent $i$ willing to pay $b_{ij}$ on item $j$ and with a maximum budget of $B_i$, the goal is to allocate items to agents to maximize revenue. Expand
  • 38
  • 6
Matching with Our Eyes Closed
  • G. Goel, P. Tripathi
  • Computer Science, Mathematics
  • IEEE 53rd Annual Symposium on Foundations of…
  • 20 October 2012
TLDR
In this paper we propose and analyze a new randomized greedy algorithm for finding a large matching in a general graph and use it to solve the query commit problem mentioned above. Expand
  • 27
  • 5
  • PDF
Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets
TLDR
In this paper we consider a mechanism design problem in the context of large-scale crowdsourcing markets such as Amazon's Mechanical Turk mturk, ClickWorker clickworker, CrowdFlower crowdflower. Expand
  • 51
  • 4
  • PDF
Efficiency of (revenue-)optimal mechanisms
TLDR
We compare the expected efficiency of revenue maximizing (or optimal) mechanisms with that of efficiency maximizing ones, when bidder valuations are drawn i.d. from a Monotone Hazard Rate distribution. Expand
  • 28
  • 4
  • PDF
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
TLDR
We introduce and study an important subclass of submodular functions, which we call discounted price functions. Expand
  • 10
  • 4
  • PDF