A dynamic learning algorithm for online matching problems with concave returns (Q319996): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Dynamic Near-Optimal Algorithm for Online Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Primal-Dual Algorithms for Covering and Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online matching with concave returns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Packing Applied to Display Ad Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian Mechanism Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of Online Packing Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak convergence and empirical processes. With applications to statistics / rank
 
Normal rank

Revision as of 15:47, 12 July 2024

scientific article
Language Label Description Also known as
English
A dynamic learning algorithm for online matching problems with concave returns
scientific article

    Statements

    A dynamic learning algorithm for online matching problems with concave returns (English)
    0 references
    0 references
    0 references
    6 October 2016
    0 references
    online algorithms
    0 references
    primal-dual
    0 references
    dynamic price update
    0 references
    random permutation model
    0 references
    adwords problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references