Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129619411, #quickstatements; #temporary_batch_1724714016629
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Vahab S. Mirrokni / rank
Normal rank
 
Property / author
 
Property / author: Vahab S. Mirrokni / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1712.05450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365114 / 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: Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for combinatorial auctions with submodular bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Non-monotone Submodular Functions / 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: Online Stochastic Matching: Beating 1-1/e / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Weighted Matching: Improved Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal deterministic algorithm for online \(b\)-matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online submodular welfare maximization: Greedy is optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bipartite matching with unknown distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal beats dual on online packing LPs in the random-order model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial auctions with decreasing marginal utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bipartite matching with random arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Matching: Online Actions Based on Offline Statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: AdWords and generalized online matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Composable Core-sets for Distributed Submodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of Online Packing Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composable and efficient mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549686 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129619411 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:20, 27 August 2024

scientific article; zbMATH DE number 6898318
Language Label Description Also known as
English
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order
scientific article; zbMATH DE number 6898318

    Statements

    Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (English)
    0 references
    0 references
    0 references
    0 references
    4 July 2018
    0 references
    submodular welfare maximization (SWM)
    0 references
    online algorithms
    0 references
    online SWM
    0 references
    random order
    0 references
    submodular optimization
    0 references
    second-order submodular functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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