163 Hits in 1.8 sec

The Adwords Problem with Strict Capacity Constraints

Umang Bhaskar, Ajil Jalal, Rahul Vaze, Marc Herbstritt
2016 Foundations of Software Technology and Theoretical Computer Science  
The weight of edges incident to any server can be at most the server capacity. Our problem is related to the adwords problem, where the assignment to a server is allowed to exceed its capacity.  ...  In many applications, however, server capacities are strict and partially-served requests are of no use, motivating the problem we study.  ...  We are grateful to Anupam Gupta for helpful discussions on the problem, as well as to the anonymous referees of a previous version of this paper for their constructive comments.  ... 
doi:10.4230/lipics.fsttcs.2016.30 dblp:conf/fsttcs/BhaskarJV16 fatcat:gytjqjwzqze65m4ftiji6zbrsa

A Survey of Adwords Problem With Small Bids In a Primal-dual Setting: Greedy Algorithm, Ranking Algorithm and Primal-dual Training-based Algorithm [article]

Haoqian Li
2019 arXiv   pre-print
Next, I will look at a primal-dual training-based algorithm for the Adwords problem with the IID model.  ...  In this survey, I will review the Adwords problem with different input models under a primal-dual setting, and with the small-bid assumption.  ...  Greedy achieves a ratio of 1 2 for the Adwords problem with the small-bids assumption.  ... 
arXiv:1910.14610v1 fatcat:kjgi6en4vbfshccrnzlcspcmvy

Online Budgeted Allocation with General Budgets [article]

Nathaniel Kell, Debmalya Panigrahi
2016 arXiv   pre-print
In this paper, we give a complete characterization of the ADWORDS problem for general advertising budgets.  ...  In the most general setting, we show that, unlike in the single-budget ADWORDS problem, obtaining a constant competitive ratio is impossible and give asymptotically tight upper and lower bounds.  ...  With this motivation, we introduce a generalization of the ADWORDS problem that we call ADWORDS with general budgets (denoted ADGENERAL).  ... 
arXiv:1603.07768v1 fatcat:454kis6mtbbijelyih2wxexnxa

Bayesian Mechanism Design

Aranyak Mehta
2013 Foundations and Trends® in Theoretical Computer Science  
Adwords and Display Ads are unrelated problems, since Adwords has a constraint on the budget, while Display Ads has a constraint on the capacity.  ...  Connect a source to all vertices in U with capacity 2 on the edges, and connect a sink from all vertices in V , again with capacity 2. Direct all edges in E from U to V with capacity 1.  ... 
doi:10.1561/0400000057 fatcat:a7zzdglqmndh3bwdcxiklxoicu

Polyhedral Clinching Auctions and the Adwords Polytope [article]

Gagan Goel and Vahab Mirrokni and Renato Paes Leme
2012 arXiv   pre-print
A central issue in applying auction theory in practice is the problem of dealing with budget-constrained agents.  ...  In particular, our characterization of the AdWords auction as polymatroidal constraints might be of independent interest.  ...  Satisfying budget constraints while keeping incentive compatibility and efficiency is a challenging problem, and it becomes even harder in the presence of complex combinatorial constraints over the set  ... 
arXiv:1201.0404v3 fatcat:2cebudvbqrcvhbmmxfom6iljny

Characterizing Optimal Adword Auctions [article]

Garud Iyengar, Anuj Kumar
2006 arXiv   pre-print
We begin with a general problem formulation which allows the privately known valuation per click to be a function of both the identity of the advertiser and the slot.  ...  We present a number of models for the adword auctions used for pricing advertising slots on search engines such as Google, Yahoo! etc.  ...  linear programming (LP) relaxation of (8) obtained by relaxing the constraint X ij ∈ {0, 1} to X ij ∈ [0, 1] is equivalent to a maximum weight flow problem on bipartite graph with unit capacities.  ... 
arXiv:cs/0611063v1 fatcat:wagyl75vmje3flftv7yeagwbvi

Adwords in a Panorama [article]

Zhiyi Huang, Qiankun Zhang, Yuhao Zhang
2020 arXiv   pre-print
The algorithm builds on several ingredients, including a combination of the online primal dual framework and the configuration linear program of matching problems recently explored by Huang and Zhang (  ...  Three decades ago, Karp, Vazirani, and Vazirani (STOC 1990) defined the online matching problem and gave an optimal 1-1/e≈ 0.632-competitive algorithm.  ...  The constraint holds with strict inequality: k =1 ∆α( ) + ∞ =k ∆β( ) = ∆α(1) + ∆β(1) + ∞ =2 ∆β( ) = ∆x(1) + 1 2 + γ ∞ =2 ∆x( ) = 1 2 + 1 4 + 2γ > 3 + 2γ 6 + 2γ .  ... 
arXiv:2009.04114v3 fatcat:ekuqt62bffahbcb4ip5zg7ivdq

The Online Stochastic Generalized Assignment Problem [chapter]

Saeed Alaei, MohammadTaghi Hajiaghayi, Vahid Liaghat
2013 Lecture Notes in Computer Science  
We present a 1 − 1 √ k -competitive algorithm for the online stochastic generalized assignment problem under the assumption that no item takes up more than 1 k fraction of the capacity of any bin.  ...  Both value and size of an item may depend on the bin in which the item is placed; the size of an item is revealed only after it has been placed in a bin; distribution information is available about the  ...  Other variations, such as soft capacity constraints, have also been considered for which we refer the reader to [5, 13, 16] . Dean et al.  ... 
doi:10.1007/978-3-642-40328-6_2 fatcat:kp2dp4idjnhgzo2xxephjip3y4

Clinching Auctions Beyond Hard Budget Constraints [article]

Gagan Goel and Vahab Mirrokni and Renato Paes Leme
2014 arXiv   pre-print
Incentive compatibility and feasibility with respect to ability-to-pay constraints are direct consequences of the clinching framework.  ...  Yet, real auction systems (such as Google AdWords) allow more sophisticated constraints on agents' ability to pay, such as average budgets.  ...  his maximum capacity.  ... 
arXiv:1404.5000v1 fatcat:3tubcz2x6bcvdft4d2svpixv2u

Markets for Efficient Public Good Allocation with Social Distancing [article]

Devansh Jalota, Qi Qi, Marco Pavone, Yinyu Ye
2021 arXiv   pre-print
Furthermore, to account for additional constraints we introduce a social convex optimization problem where we perturb the budgets of agents such that the KKT conditions of the perturbed social problem  ...  To design these mechanisms, we leverage the theory of Fisher markets, wherein each agent in the economy is endowed with an artificial currency budget that they can spend to avail public goods.  ...  This article solely reflects the opinions of its authors and not NSF, TRI, or any other entity.  ... 
arXiv:2005.10765v4 fatcat:32nowd4ntzbe3izknli64sopv4

How to differentiate by price: Proposal for a five-dimensional model

Einar Iveroth, Alf Westelius, Carl-Johan Petri, Nils-Göran Olve, Mathias Cöster, Fredrik Nilsson
2013 European Management Journal  
This article offers a more integrated perspective, derived from earlier theory as well as discussions in a collaborative research project with the international telecom company Ericsson.  ...  The purpose of this article is to analyse the repertoire of possible price models that organisations may deploy for their products and services.  ...  Not only is the pace of technological development rapid (as predicted already by Turing, 1950) , with the consequence that cost and physical size of IT capacity keep falling.  ... 
doi:10.1016/j.emj.2012.06.007 fatcat:o6p36tv2prhvxechspaspvrqva


Jeff Shute, Stephan Ellner, John Cieslewicz, Ian Rae, Traian Stancescu, Himani Apte, Radek Vingralek, Bart Samwel, Ben Handy, Chad Whipkey, Eric Rollins, Mircea Oancea (+2 others)
2013 Proceedings of the VLDB Endowment  
F1 is a distributed relational database system built at Google to support the AdWords business.  ...  Consistency: The system must provide ACID transactions, and must always present applications with 1 Previously described briefly in [22] .  ...  We'd also like to thank the many developers and users across all AdWords teams who migrated their systems to F1, and who played a large role influencing and validating the design of this system.  ... 
doi:10.14778/2536222.2536232 fatcat:6w7b2gioineilasvrj2aodkqju

Online Stochastic Packing Applied to Display Ad Allocation [article]

Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Cliff Stein
2010 arXiv   pre-print
This is a significant improvement over logarithmic or constant-factor approximations for the adversarial variants of the same problems (e.g. factor 1 - 1/e for online ad allocation, and \log m for online  ...  We then focus on the online display ad allocation problem and study the efficiency and fairness of various training-based and online allocation algorithms on data sets collected from real-life display  ...  This paper is a followup of our previous work with S. Muthukrishnan and Martin Pál, and some of the results and discussions in this paper are inspired by our initial discussions with them.  ... 
arXiv:1001.5076v2 fatcat:dxwj53iawnbxlkvqqaelqinlxq

Approximation Algorithms for Stochastic Combinatorial Optimization Problems

Jian Li, Yu Liu
2016 Journal of the Operations Research Society of China  
Since most problems in this domain are NP-hard (or #P-hard, or even PSPACE-hard), we focus on the results which provide polynomial time approximation algorithms, with provable approximation guarantees.  ...  Our purpose is to provide the readers a quick glimpse to the models, problems and techniques in this area, and hopefully inspire new contributions.  ...  Concluding Remarks and Acknowledgement Due to the limit of space and the authors' knowledge, this survey is by no means comprehensive.  ... 
doi:10.1007/s40305-015-0116-9 fatcat:wewxh47vgjgazg3thpbnonreaq


Gokul Nath Babu Manoharan, Chad Whipkey, Larysa Aharkava, Himani Apte, Nitin Gangahar, Jun Xu, Shivakumar Venkataraman, Divyakant Agrawal, Jeffrey D. Ullman, Stephan Ellner, Karl Schnaitter, Sridatta Chegu (+5 others)
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
The system we describe is in production at Google, powering critical applications used by advertisers and internal sales teams.  ...  To execute these SQL queries with low latency at scale, we leveraged and extended F1's distributed query engine with facilities such as safe execution of C++ and Java UDFs.  ...  We are grateful to the F1 team, including Brian Biskeborn, John Cieslewicz, Daniel Tenedo-rio, and Michael Styer, and to the Mesa team, including Mingsheng Hong, Kevin Lai, and Tao Zou.  ... 
doi:10.1145/2882903.2904444 dblp:conf/sigmod/ManoharanESCEGG16 fatcat:3p43idnt7neilidmhe4gzegexu
« Previous Showing results 1 — 15 out of 163 results