The Adwords Problem with Strict Capacity Constraints.

DOI10.4230/LIPIcs.FSTTCS.2016.30zbMath1391.68125OpenAlexW2571778556MaRDI QIDQ4636578

Ajil Jalal, Umang Bhaskar, Rahul Vaze

Publication date: 19 April 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2016.30

zbMATH Keywords

online algorithmsgreedy algorithmsbudgeted matchingadwords

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Online algorithms; streaming algorithms (68W27)

This page was built for publication: The Adwords Problem with Strict Capacity Constraints.