#### Filter Results:

- Full text PDF available (93)

#### Publication Year

2002

2017

- This year (10)
- Last 5 years (49)
- Last 10 years (78)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nikhil R. Devanur, Thomas P. Hayes
- EC
- 2009

We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize the revenue generated by these keyword sales, bearing in mind that, as some bidders may eventually exceed their budget, not all keywords should be sold to the highest bidder. Weâ€¦ (More)

Arora, Rao and Vazirani [2] showed that the standard semi-definite programming (SDP) relaxation of the Sparsest Cut problem with the <i>triangle inequality</i> constraints has an integrality gap of O(√log n). They conjectured that the gap is bounded from above by a constant. In this paper, we disprove this conjecture (referred to as theâ€¦ (More)

We give the first polynomial time algorithm for exactly computing an equilibrium for the linear utilities case of the market model defined by Fisher. Our algorithm uses the primal--dual paradigm in the enhanced setting of KKT conditions and convex programs. We pinpoint the added difficulty raised by this setting and the manner in which our algorithmâ€¦ (More)

Although the study of market equilibria has occupied center stage within Mathematical Economics for over a century, polynomial time algorithms for such questions have so far evaded researchers. We provide the first such algorithm for the linear version of a problem defined by Irving Fisher in 1891. Our algorithm is modeled after Kuhnâ€™s primaldual algorithmâ€¦ (More)

- Nikhil R. Devanur, Sham M. Kakade
- EC
- 2009

We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the classic explore/exploit dilemma: while gathering information about the click through rates of advertisers, the mechanism may loose revenue; however, this gleaned information may proveâ€¦ (More)

- Nikhil R. Devanur, Kamal Jain
- STOC
- 2012

We consider a <i>significant</i> generalization of the Adwords problem by <i>allowing arbitrary concave returns, and we characterize the optimal competitive ratio achievable</i>. The problem considers a sequence of items arriving online that have to be allocated to agents, with different agents bidding different amounts. The objective function is the sum,â€¦ (More)

- Ye Chen, Pavel Berkhin, Bo Anderson, Nikhil R. Devanur
- KDD
- 2011

We describe a real-time bidding algorithm for performance-based display ad allocation. A central issue in performance display advertising is matching campaigns to ad impressions, which can be formulated as a constrained optimization problem that maximizes revenue subject to constraints such as budget limits and inventory availability. The current practiceâ€¦ (More)

- Monia Ghobadi, Ratul Mahajan, +7 authors Daniel C. Kilper
- SIGCOMM
- 2016

We explore a novel, free-space optics based approach for building data center interconnects. It uses a digital micromirror device (DMD) and mirror assembly combination as a transmitter and a photodetector on top of the rack as a receiver (Figure 1). Our approach enables all pairs of racks to establish direct links, and we can reconfigure such links (i.e.,â€¦ (More)

- Yossi Azar, Benjamin E. Birnbaum, L. Elisa Celis, Nikhil R. Devanur, Yuval Peres
- 2009 50th Annual IEEE Symposium on Foundations ofâ€¦
- 2009

Bargaining games on exchange networks have been studied by both economists and sociologists. A Balanced Outcome for such a game is an equilibrium concept that combines notions of stability and fairness. In a recent paper, Kleinberg and Tardos introduced balanced outcomes to the computer science community and provided a polynomial-time algorithm to computeâ€¦ (More)

We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains many interesting special cases such as the Adwords problem. In the online setting we introduce a new distributional model called the adversarial stochastic input model, which is aâ€¦ (More)