Approximation algorithms for stochastic online matching with reusable resources (Q6046972): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal Sequential Assignments with Random Arrival Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A markov chain version of the secretary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov decision processes and stochastic games with total effective payoff / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Stochastic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hiring Secretaries over Time: The Benefit of Concurrent Employment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of Jobs with Fixed Start Times on Related Machines / 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: The Temp Secretary Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online interval scheduling: Randomized and multiprocessor cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3511006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequential Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiamarts and finite values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128889 / 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: A Sequential Stochastic Assignment Problem in a Partially Observable Markov Chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: <b>Technical Note</b>—Stochastic Sequential Decision-Making with a Random Number of Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized online interval scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online C-benevolent job scheduling on multiple machines / rank
 
Normal rank

Latest revision as of 20:03, 2 August 2024

scientific article; zbMATH DE number 7735002
Language Label Description Also known as
English
Approximation algorithms for stochastic online matching with reusable resources
scientific article; zbMATH DE number 7735002

    Statements

    Approximation algorithms for stochastic online matching with reusable resources (English)
    0 references
    0 references
    0 references
    0 references
    6 September 2023
    0 references
    approximation algorithms
    0 references
    online algorithms
    0 references
    stochastic matching
    0 references
    reusable resources
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references