Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads

Authors:
Denis Charles;Max Chickering;Nikhil R. Devanur;Kamal Jain;Manan Sanghi
Affiliations:
Microsoft Corporation, Redmond, WA, USA;Microsoft Corporation, Redmond, WA, USA;Microsoft Corporation, Redmond, WA, USA;Microsoft Corporation, Redmond, WA, USA;Microsoft Corporation, Redmond, WA, USA
Venue:
Proceedings of the 11th ACM conference on Electronic commerce
Year:
2010

Citing 6
Cited 10

Improved Algorithms for Bipartite Network Flow

SIAM Journal on Computing
Beyond the flow decomposition barrier

Journal of the ACM (JACM)
The adwords problem: online keyword matching with budgeted bidders under random permutations

Proceedings of the 10th ACM conference on Electronic commerce
An expressive auction design for online display advertising

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Bidding for Representative Allocations for Display Advertising

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Fractional matching via balls-and-bins

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation

Social content matching in MapReduce

Proceedings of the VLDB Endowment
Near optimal online algorithms and fast approximation algorithms for resource allocation problems

Proceedings of the 12th ACM conference on Electronic commerce
Online algorithms with stochastic input

ACM SIGecom Exchanges
Real-time bidding algorithms for performance-based display ad allocation

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast matrix rank algorithms and applications

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Asymptotically optimal algorithm for stochastic adwords

Proceedings of the 13th ACM Conference on Electronic Commerce
Implicit computation of maximum bipartite matchings by sublinear functional operations

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Optimizing budget constrained spend in search advertising

Proceedings of the sixth ACM international conference on Web search and data mining
Fast matrix rank algorithms and applications

Journal of the ACM (JACM)
A distributed algorithm for large-scale generalized matching

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to represent them in memory or to identify matchings using standard approaches. Detecting and representing matchings in lopsided bipartite graphs is important for allocating and delivering guaranteed-placement display ads, where the corresponding bipartite graph of interest has nodes representing advertisers on one side and nodes representing web-page impressions on the other; real-world instances of such graphs can have billions of impression nodes. We provide theoretical guarantees for our algorithms, and in a real-world advertising application, we demonstrate the feasibility of our detection algorithms.