The balloon popping problem revisited: lower and upper bounds (Q647488): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Revenue maximization when bidders have budgets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Randomized Mechanisms for Combinatorial Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful randomized mechanisms for combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem of arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximizing welfare when utility functions are subadditive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AdWords and generalized online matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Auction Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: 75.9 Euler’s Constant / rank
 
Normal rank

Latest revision as of 16:55, 4 July 2024

scientific article
Language Label Description Also known as
English
The balloon popping problem revisited: lower and upper bounds
scientific article

    Statements

    The balloon popping problem revisited: lower and upper bounds (English)
    0 references
    0 references
    0 references
    23 November 2011
    0 references
    0 references
    auction
    0 references
    lower bound
    0 references
    upper bound
    0 references
    ballot theorem
    0 references
    0 references