On Certain Greed Polyhedra, Partially Indexable Scheduling Problems, and Extended Restless Bandit Allocation Indices

SSRN Electronic Journal
doi 10.2139/ssrn.230871
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Comments On: Dynamic Priority Allocation via Restless Bandit Marginal Productivity Indices

TOP
Information SystemsProbabilityCombinatoricsSimulationManagement ScienceManagementStatisticsDiscrete MathematicsModelingOperations Research
2007English

A Class of Bandit Problems Yielding Myopic Optimal Strategies

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
1992English

Widows, Greed, and Large Inheritance: Problems of Political Succession in Asia

The Journal of Political Theory, Political Philosophy and Sociology of Politics Politeia
2014English

Quick Best Action Identification in Linear Bandit Problems

2018English

"A Certain Restless Ambition": Women Physicians and World War I

American Quarterly
Cultural StudiesHistory
1989English

On Certain Group Ring Problems

Bulletin of the Australian Mathematical Society
Mathematics
1980English

On Extended General Mittag–Leffler Functions and Certain Inequalities

Fractal and Fractional
2019English

W1,qREGULARITY RESULTS FOR ELLIPTIC TRANSMISSION PROBLEMS ON HETEROGENEOUS POLYHEDRA

Mathematical Models and Methods in Applied Sciences
ModelingApplied MathematicsSimulation
2007English

Sub-Polyhedral Scheduling Using (Unit-)Two-Variable-Per-Inequality Polyhedra

2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy