research-article

Group-Aware Weighted Bipartite B-Matching

Authors:

Venkatesh Srinivasan,

Alex ThomoAuthors Info & Claims

CIKM '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management

Pages 459 - 468

https://doi.org/10.1145/2983323.2983770

Published: 24 October 2016 Publication History

Abstract

The weighted bipartite B-matching (WBM) problem models a host of data management applications, ranging from recommender systems to Internet advertising and e-commerce. Many of these applications, however, demand versatile assignment constraints, which WBM is weak at modelling.

In this paper, we investigate powerful generalisations of WBM. We first show that a recent proposal for conflict-aware WBM by Chen et al. is hard to approximate by reducing their problem from Maximum Weight Independent Set. We then propose two related problems, collectively called group-aware WBM. For the first problem, which constrains the degree of groups of vertices, we show that a linear programming formulation produces a Totally Unimodular (TU) matrix and is thus polynomial-time solvable. Nonetheless, we also give a simple greedy algorithm subject to a 2-extendible system that scales to higher workloads. For the second problem, which instead limits the budget of groups of vertices, we prove its NP-hardness but again give a greedy algorithm with an approximation guarantee. Our experimental evaluation reveals that the greedy algorithms vastly outperform their theoretical guarantees and scale to bipartite graphs with more than eleven million edges.

References

[1]

G. Adomavicius and Y. Kwon. Maximizing aggregate recommendation diversity: A graph-theoretic approach. In Proc. DiveRS, page 3, 2011.

[2]

N. Andelman and Y. Mansour. Auctions with budget constraints. In Proc. SWAT, pages 26--38, 2004.

[3]

E. M. Arkin and E. B. Silverberg. Scheduling jobs with fixed start and end times. Discrete Appl. Math., 18(1):1--8, 1987.

Digital Library

[4]

A. S. Asratian, T. M. J. Denley, and R. Häggkvist. Bipartite Graphs and Their Applications. Cambridge University Press, New York, NY, USA, 1998.

[5]

D. P. Bertsekas. A new algorithm for the assignment problem. Math. Program., 21(1):152--171, 1981.

Digital Library

[6]

A. Bhalgat, N. Korula, H. Leontyev, M. Lin, and V. S. Mirrokni. Partner tiering in display advertising. In Proc. WSDM, pages 133--142, 2014.

Digital Library

[7]

R. Bhatia, J. Chuzhoy, A. Freund, and N. J. (Seffi). Algorithmic aspects of bandwidth trading. TALG, 3(1):10:1--10:19, 2007.

Digital Library

[8]

G. Călinescu, C. Chekuri, M. Pál, and J. Vondrák. Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput., 40(6):1740--1766, 2011.

Digital Library

[9]

D. Chakrabarty and G. Goel. On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and gap. SIAM J. Comp., 39(6):2189--2211, 2010.

Digital Library

[10]

C. Chen, L. Zheng, V. Srinivasan, A. Thomo, K. Wu, and A. Sukow. Conflict-aware weighted bipartite B-matching and its application to e-commerce. TKDE, 28(6):1475--1488, 2016.

Digital Library

[11]

N. R. Devanur and T. P. Hayes. The adwords problem: online keyword matching with budgeted bidders under random permutations. In Proc. EC, pages 71--78, 2009.

Digital Library

[12]

B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. The American economic review, 97(1):242--259, 2007.

[13]

M. Fayyazi, D. Kaeli, and W. Meleis. Parallel maximum weight bipartite matching algorithms for scheduling in input-queued switches. In Proc. IPDPS, page 4, 2004.

[14]

D. Fleder and K. Hosanagar. Blockbuster culture's next rise or fall: The impact of recommender systems on sales diversity. Manage. Sci., 55(5):697--712, 2009.

Digital Library

[15]

S. Fujishige. Submodular functions and optimization, volume 58 of Annals of discrete mathematics. Elsevier, 2005.

[16]

R. Garg, V. Kumar, and V. Pandit. Approximation algorithms for budget-constrained auctions. In Proc. APPROX, pages 102--113, 2001.

Digital Library

[17]

J. Håstad. Clique is hard to approximate withinn 1- ε. Acta Mathematica, 182(1):105--142, 1999.

[18]

C. Kalaitzis. An improved approximation guarantee for the maximum budgeted allocation problem. In Proc. SODA, pages 1048--1066, 2016.

Digital Library

[19]

A. W. J. Kolen, J. K. Lenstra, C. H. Papadimitriou, and F. C. R. Spieksma. Interval scheduling: A survey. Naval Research Logistics, 54(5):530--543, 2007.

[20]

A. Krause and C. Guestrin. Beyond convexity: Submodularity in machine learning. ICML Tutorials, 2008.

[21]

H. W. Kuhn. The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2:83--97, 1955.

[22]

N. Lathia, S. Hailes, L. Capra, and X. Amatriain. Temporal diversity in recommender systems. In SIGIR, pages 210--217, 2010.

Digital Library

[23]

B. Lehmann, D. Lehmann, and N. Nisan. Combinatorial auctions with decreasing marginal utilities. In Proc. EC, pages 18--28, 2001.

Digital Library

[24]

J. Leskovec, L. A. Adamic, and B. A. Huberman. The dynamics of viral marketing. TWEB, 1(1):5, 2007.

Digital Library

[25]

W. Lu, S. Chen, K. Li, and L. V. Lakshmanan. Show me the money: dynamic recommendations for revenue maximization. PVLDB, 7(14):1785--1796, 2014.

Digital Library

[26]

A. Mehta. Online matching and ad allocation. Found. and Trends in Theor. Comput. Sci., 8(4):265--368, 2013.

Digital Library

[27]

A. Mehta, A. Saberi, U. V. Vazirani, and V. V. Vazirani. Adwords and generalized online matching. J. ACM, 54(5), 2007.

Digital Library

[28]

R. Meir, Y. Chen, and M. Feldman. Efficient parking allocation as online bipartite matching with posted prices. In Proc. AAMAS, pages 303--310, 2013.

Digital Library

[29]

J. Mestre. Greedy in approximation algorithms. In ESA, pages 528--539, 2006.

Digital Library

[30]

M. Minoux. Accelerated greedy algorithms for maximizing submodular set functions. In Proc. Optimization Techniques, pages 234--243, 1978.

[31]

G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions--I. Math. Program., 14(1):265--294, 1978.

Digital Library

[32]

F. Radlinski, R. Kleinberg, and T. Joachims. Learning diverse rankings with multi-armed bandits. In ICML, pages 784--791, 2008.

Digital Library

[33]

K. R. Rebman. Total unimodularity and the transportation problem: a generalization. Linear Algebra and its Applications, 8(1):11--24, 1974.

[34]

T. Sandholm and S. Suri. Side constraints and non-price attributes in markets. Games and Economic Behavior, 55(2):321--330, 2006.

[35]

A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, Inc., New York, NY, USA, 1986.

Digital Library

[36]

E. Vee, U. Srivastava, J. Shanmugasundaram, P. Bhat, and S. A. Yahia. Efficient computation of diverse query results. In ICDE, pages 228--236, 2008.

Digital Library

[37]

M. Yannakakis. On a class of totally unimodular matrices. In Proc. FOCS, pages 10--16, Oct 1980.

Digital Library

[38]

C.-N. Ziegler, S. M. McNee, J. A. Konstan, and G. Lausen. Improving recommendation lists through topic diversification. In WWW, pages 22--32, 2005.

Digital Library

Cited By

Taik AMlika ZCherkaoui S(2022)Clustered Vehicular Federated Learning: Process and OptimizationIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2022.314986023:12(25371-25383)Online publication date: Dec-2022
https://doi.org/10.1109/TITS.2022.3149860
Zhou YFan MMa FYin M(2022)Solving multi-objective constrained minimum weighted bipartite assignment problem: a case study on energy-aware radio broadcast schedulingScience China Information Sciences10.1007/s11432-019-3017-965:8Online publication date: 25-Jul-2022
https://doi.org/10.1007/s11432-019-3017-9
He FOki E(2021)Main and Secondary Controller Assignment With Optimal Priority Policy Against Multiple FailuresIEEE Transactions on Network and Service Management10.1109/TNSM.2021.306464618:4(4391-4405)Online publication date: Dec-2021
https://doi.org/10.1109/TNSM.2021.3064646
Show More Cited By

Index Terms

Group-Aware Weighted Bipartite B-Matching
1. Information systems
  1. World Wide Web
    1. Web searching and information discovery
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Approximation algorithms
      2. Graph algorithms

Recommendations

Complexity of a disjoint matching problem on bipartite graphs

We consider the following question: given an ( X , Y ) -bigraph G and a set S ź X , does G contain two disjoint matchings M 1 and M 2 such that M 1 saturates X and M 2 saturates S? When | S | ź | X | - 1 , this question is solvable by finding an ...
An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs

A semi-matching on a bipartite graph G = (U ∪ V, E) is a set of edges X ⊆ E such that each vertex in U is incident to exactly one edge in X. The sum of the weights of the vertices from U that are assigned (semi-matched) to some vertex v ∈ V is referred ...
Maximum weight induced matching in some subclasses of bipartite graphs
Abstract
A subset $M \subseteq E$ of edges of a graph $G = (V, E)$ is called a matching in G if no two edges in M share a common vertex. A matching M in G is called an induced matching if G[M], the subgraph of G induced by M, is the same as G[S], the subgraph of G induced ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CIKM '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management

October 2016

2566 pages

ISBN:9781450340731

DOI:10.1145/2983323

General Chairs:
Snehasis Mukhopadhyay
Indiana University Purdue University Indianapolis, USA
,
ChengXiang Zhai
University of Illinois at Urbana-Champaign, USA
,
Program Chairs:
Elisa Bertino
Purdue University
,
Fabio Crestani
University of Lugano
,
Javed Mostafa
University of North Carolina
,
Jie Tang
Tsinghua University
,
Luo Si
Alibaba Group Inc & Purdue University
,
Xiaofang Zhou
University of Queensland
,
Yi Chang
Yahoo Research
,
Yunyao Li
IBM Research - Almaden
,
Parikshit Sondhi
WalmartLabs

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 October 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Natural Sciences and Engineering Research Council of Canada

Conference

CIKM'16

Sponsor:

CIKM'16: ACM Conference on Information and Knowledge Management

October 24 - 28, 2016

Indiana, Indianapolis, USA

Acceptance Rates

CIKM '16 Paper Acceptance Rate 160 of 701 submissions, 23%;

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
315
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)5

Reflects downloads up to 22 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Taik AMlika ZCherkaoui S(2022)Clustered Vehicular Federated Learning: Process and OptimizationIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2022.314986023:12(25371-25383)Online publication date: Dec-2022
https://doi.org/10.1109/TITS.2022.3149860
Zhou YFan MMa FYin M(2022)Solving multi-objective constrained minimum weighted bipartite assignment problem: a case study on energy-aware radio broadcast schedulingScience China Information Sciences10.1007/s11432-019-3017-965:8Online publication date: 25-Jul-2022
https://doi.org/10.1007/s11432-019-3017-9
He FOki E(2021)Main and Secondary Controller Assignment With Optimal Priority Policy Against Multiple FailuresIEEE Transactions on Network and Service Management10.1109/TNSM.2021.306464618:4(4391-4405)Online publication date: Dec-2021
https://doi.org/10.1109/TNSM.2021.3064646
Guo LLi JWu JChang WWu J(2018)A Novel Airbnb Matching Scheme in Shared Economy Using Confidence and Prediction Uncertainty AnalysisIEEE Access10.1109/ACCESS.2018.28018106(10320-10331)Online publication date: 2018
https://doi.org/10.1109/ACCESS.2018.2801810

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents