2026-07-26T04:14:53Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6798 2024-03-06T10:38:54Z ddc:004 open_access

Bipartite Matching with Linear Edge Weights Domanic, Nevzat Onur Lam, Chi-Kit Plaxton, C. Gregory Weighted bipartite matching Unit-demand auctions VCG allocation and pricing Consider a complete weighted bipartite graph G in which each left vertex u has two real numbers intercept and slope, each right vertex v has a real number quality, and the weight of any edge (u, v) is defined as the intercept of u plus the slope of u times the quality of v. Let m (resp., n) denote the number of left (resp., right) vertices, and assume that m geq n. We develop a fast algorithm for computing a maximum weight matching (MWM) of such a graph. Our algorithm begins by computing an MWM of the subgraph induced by the n right vertices and an arbitrary subset of n left vertices; this step is straightforward to perform in O(n log n) time. The remaining m - n left vertices are then inserted into the graph one at a time, in arbitrary order. As each left vertex is inserted, the MWM is updated. It is relatively straightforward to process each such insertion in O(n) time; our main technical contribution is to improve this time bound to O(sqrt{n} log^2 n). This result has an application related to unit-demand auctions. It is well known that the VCG mechanism yields a suitable solution (allocation and prices) for any unit-demand auction. The graph G may be viewed as encoding a special kind of unit-demand auction in which each left vertex u represents a unit-demand bid, each right vertex v represents an item, and the weight of an edge (u, v) represents the offer of bid u on item v. In this context, our fast insertion algorithm immediately provides an O(sqrt{n} log^2 n)-time algorithm for updating a VCG allocation when a new bid is received. We show how to generalize the insertion algorithm to update (an efficient representation of) the VCG prices within the same time bound. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Nevzat Onur Domanic and Chi-Kit Lam and C. Gregory Plaxton 2016 Is Part Of LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2016.28 urn:nbn:de:0030-drops-67989 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.28 eng https://creativecommons.org/licenses/by/3.0/legalcode