On the evaluation of strategies for branching bandit processes
Abstract Glazebrook [1] has given an account of improved procedures for strategy evaluation for resource allocation in a stochastic environment. These methods are extended in the paper in such a way that they can be applied to problems which, for example, have precedence constraints and/or an arriva...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Glazebrook, K. D. [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
1991 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© J.C. Baltzer A.G. Scientific Publishing Company 1991 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Annals of operations research - Baltzer Science Publishers, Baarn/Kluwer Academic Publishers, 1984, 30(1991), 1 vom: Dez., Seite 299-319 |
|---|---|
| Übergeordnetes Werk: |
volume:30 ; year:1991 ; number:1 ; month:12 ; pages:299-319 |
| Links: |
|---|
| DOI / URN: |
10.1007/BF02204822 |
|---|
| Katalog-ID: |
OLC2111115800 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2111115800 | ||
| 003 | DE-627 | ||
| 005 | 20230502202342.0 | ||
| 007 | tu | ||
| 008 | 230502s1991 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/BF02204822 |2 doi | |
| 035 | |a (DE-627)OLC2111115800 | ||
| 035 | |a (DE-He213)BF02204822-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 084 | |a 3,2 |2 ssgn | ||
| 100 | 1 | |a Glazebrook, K. D. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a On the evaluation of strategies for branching bandit processes |
| 264 | 1 | |c 1991 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © J.C. Baltzer A.G. Scientific Publishing Company 1991 | ||
| 520 | |a Abstract Glazebrook [1] has given an account of improved procedures for strategy evaluation for resource allocation in a stochastic environment. These methods are extended in the paper in such a way that they can be applied to problems which, for example, have precedence constraints and/or an arrivals process of new jobs. Theoretical results, backed up by numerical studies, show that quasi-myopic heuristics often perform well. | ||
| 650 | 4 | |a Bandit process | |
| 650 | 4 | |a Gittins' index | |
| 650 | 4 | |a Markov decision process | |
| 650 | 4 | |a stopping time | |
| 650 | 4 | |a strategy evaluation | |
| 700 | 1 | |a Boys, R. J. |4 aut | |
| 700 | 1 | |a Fay, N. A. |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Annals of operations research |d Baltzer Science Publishers, Baarn/Kluwer Academic Publishers, 1984 |g 30(1991), 1 vom: Dez., Seite 299-319 |w (DE-627)12964370X |w (DE-600)252629-3 |w (DE-576)018141862 |x 0254-5330 |
| 773 | 1 | 8 | |g volume:30 |g year:1991 |g number:1 |g month:12 |g pages:299-319 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/BF02204822 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_90 | ||
| 912 | |a GBV_ILN_4029 | ||
| 951 | |a AR | ||
| 952 | |d 30 |j 1991 |e 1 |c 12 |h 299-319 | ||
| author_variant |
k d g kd kdg r j b rj rjb n a f na naf |
|---|---|
| matchkey_str |
article:02545330:1991----::nheautoosrtgefrrnhn |
| hierarchy_sort_str |
1991 |
| publishDate |
1991 |
| allfields |
10.1007/BF02204822 doi (DE-627)OLC2111115800 (DE-He213)BF02204822-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Glazebrook, K. D. verfasserin aut On the evaluation of strategies for branching bandit processes 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © J.C. Baltzer A.G. Scientific Publishing Company 1991 Abstract Glazebrook [1] has given an account of improved procedures for strategy evaluation for resource allocation in a stochastic environment. These methods are extended in the paper in such a way that they can be applied to problems which, for example, have precedence constraints and/or an arrivals process of new jobs. Theoretical results, backed up by numerical studies, show that quasi-myopic heuristics often perform well. Bandit process Gittins' index Markov decision process stopping time strategy evaluation Boys, R. J. aut Fay, N. A. aut Enthalten in Annals of operations research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers, 1984 30(1991), 1 vom: Dez., Seite 299-319 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:30 year:1991 number:1 month:12 pages:299-319 https://doi.org/10.1007/BF02204822 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_90 GBV_ILN_4029 AR 30 1991 1 12 299-319 |
| spelling |
10.1007/BF02204822 doi (DE-627)OLC2111115800 (DE-He213)BF02204822-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Glazebrook, K. D. verfasserin aut On the evaluation of strategies for branching bandit processes 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © J.C. Baltzer A.G. Scientific Publishing Company 1991 Abstract Glazebrook [1] has given an account of improved procedures for strategy evaluation for resource allocation in a stochastic environment. These methods are extended in the paper in such a way that they can be applied to problems which, for example, have precedence constraints and/or an arrivals process of new jobs. Theoretical results, backed up by numerical studies, show that quasi-myopic heuristics often perform well. Bandit process Gittins' index Markov decision process stopping time strategy evaluation Boys, R. J. aut Fay, N. A. aut Enthalten in Annals of operations research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers, 1984 30(1991), 1 vom: Dez., Seite 299-319 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:30 year:1991 number:1 month:12 pages:299-319 https://doi.org/10.1007/BF02204822 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_90 GBV_ILN_4029 AR 30 1991 1 12 299-319 |
| allfields_unstemmed |
10.1007/BF02204822 doi (DE-627)OLC2111115800 (DE-He213)BF02204822-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Glazebrook, K. D. verfasserin aut On the evaluation of strategies for branching bandit processes 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © J.C. Baltzer A.G. Scientific Publishing Company 1991 Abstract Glazebrook [1] has given an account of improved procedures for strategy evaluation for resource allocation in a stochastic environment. These methods are extended in the paper in such a way that they can be applied to problems which, for example, have precedence constraints and/or an arrivals process of new jobs. Theoretical results, backed up by numerical studies, show that quasi-myopic heuristics often perform well. Bandit process Gittins' index Markov decision process stopping time strategy evaluation Boys, R. J. aut Fay, N. A. aut Enthalten in Annals of operations research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers, 1984 30(1991), 1 vom: Dez., Seite 299-319 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:30 year:1991 number:1 month:12 pages:299-319 https://doi.org/10.1007/BF02204822 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_90 GBV_ILN_4029 AR 30 1991 1 12 299-319 |
| allfieldsGer |
10.1007/BF02204822 doi (DE-627)OLC2111115800 (DE-He213)BF02204822-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Glazebrook, K. D. verfasserin aut On the evaluation of strategies for branching bandit processes 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © J.C. Baltzer A.G. Scientific Publishing Company 1991 Abstract Glazebrook [1] has given an account of improved procedures for strategy evaluation for resource allocation in a stochastic environment. These methods are extended in the paper in such a way that they can be applied to problems which, for example, have precedence constraints and/or an arrivals process of new jobs. Theoretical results, backed up by numerical studies, show that quasi-myopic heuristics often perform well. Bandit process Gittins' index Markov decision process stopping time strategy evaluation Boys, R. J. aut Fay, N. A. aut Enthalten in Annals of operations research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers, 1984 30(1991), 1 vom: Dez., Seite 299-319 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:30 year:1991 number:1 month:12 pages:299-319 https://doi.org/10.1007/BF02204822 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_90 GBV_ILN_4029 AR 30 1991 1 12 299-319 |
| allfieldsSound |
10.1007/BF02204822 doi (DE-627)OLC2111115800 (DE-He213)BF02204822-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Glazebrook, K. D. verfasserin aut On the evaluation of strategies for branching bandit processes 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © J.C. Baltzer A.G. Scientific Publishing Company 1991 Abstract Glazebrook [1] has given an account of improved procedures for strategy evaluation for resource allocation in a stochastic environment. These methods are extended in the paper in such a way that they can be applied to problems which, for example, have precedence constraints and/or an arrivals process of new jobs. Theoretical results, backed up by numerical studies, show that quasi-myopic heuristics often perform well. Bandit process Gittins' index Markov decision process stopping time strategy evaluation Boys, R. J. aut Fay, N. A. aut Enthalten in Annals of operations research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers, 1984 30(1991), 1 vom: Dez., Seite 299-319 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:30 year:1991 number:1 month:12 pages:299-319 https://doi.org/10.1007/BF02204822 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_90 GBV_ILN_4029 AR 30 1991 1 12 299-319 |
| language |
English |
| source |
Enthalten in Annals of operations research 30(1991), 1 vom: Dez., Seite 299-319 volume:30 year:1991 number:1 month:12 pages:299-319 |
| sourceStr |
Enthalten in Annals of operations research 30(1991), 1 vom: Dez., Seite 299-319 volume:30 year:1991 number:1 month:12 pages:299-319 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Bandit process Gittins' index Markov decision process stopping time strategy evaluation |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Annals of operations research |
| authorswithroles_txt_mv |
Glazebrook, K. D. @@aut@@ Boys, R. J. @@aut@@ Fay, N. A. @@aut@@ |
| publishDateDaySort_date |
1991-12-01T00:00:00Z |
| hierarchy_top_id |
12964370X |
| dewey-sort |
14 |
| id |
OLC2111115800 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2111115800</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202342.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s1991 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF02204822</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111115800</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF02204822-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Glazebrook, K. D.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the evaluation of strategies for branching bandit processes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1991</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© J.C. Baltzer A.G. Scientific Publishing Company 1991</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Glazebrook [1] has given an account of improved procedures for strategy evaluation for resource allocation in a stochastic environment. These methods are extended in the paper in such a way that they can be applied to problems which, for example, have precedence constraints and/or an arrivals process of new jobs. Theoretical results, backed up by numerical studies, show that quasi-myopic heuristics often perform well.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bandit process</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gittins' index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Markov decision process</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">stopping time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">strategy evaluation</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Boys, R. J.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fay, N. A.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Baltzer Science Publishers, Baarn/Kluwer Academic Publishers, 1984</subfield><subfield code="g">30(1991), 1 vom: Dez., Seite 299-319</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:30</subfield><subfield code="g">year:1991</subfield><subfield code="g">number:1</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:299-319</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF02204822</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">30</subfield><subfield code="j">1991</subfield><subfield code="e">1</subfield><subfield code="c">12</subfield><subfield code="h">299-319</subfield></datafield></record></collection>
|
| author |
Glazebrook, K. D. |
| spellingShingle |
Glazebrook, K. D. ddc 004 ssgn 3,2 misc Bandit process misc Gittins' index misc Markov decision process misc stopping time misc strategy evaluation On the evaluation of strategies for branching bandit processes |
| authorStr |
Glazebrook, K. D. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)12964370X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0254-5330 |
| topic_title |
004 VZ 3,2 ssgn On the evaluation of strategies for branching bandit processes Bandit process Gittins' index Markov decision process stopping time strategy evaluation |
| topic |
ddc 004 ssgn 3,2 misc Bandit process misc Gittins' index misc Markov decision process misc stopping time misc strategy evaluation |
| topic_unstemmed |
ddc 004 ssgn 3,2 misc Bandit process misc Gittins' index misc Markov decision process misc stopping time misc strategy evaluation |
| topic_browse |
ddc 004 ssgn 3,2 misc Bandit process misc Gittins' index misc Markov decision process misc stopping time misc strategy evaluation |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Annals of operations research |
| hierarchy_parent_id |
12964370X |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Annals of operations research |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 |
| title |
On the evaluation of strategies for branching bandit processes |
| ctrlnum |
(DE-627)OLC2111115800 (DE-He213)BF02204822-p |
| title_full |
On the evaluation of strategies for branching bandit processes |
| author_sort |
Glazebrook, K. D. |
| journal |
Annals of operations research |
| journalStr |
Annals of operations research |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
1991 |
| contenttype_str_mv |
txt |
| container_start_page |
299 |
| author_browse |
Glazebrook, K. D. Boys, R. J. Fay, N. A. |
| container_volume |
30 |
| class |
004 VZ 3,2 ssgn |
| format_se |
Aufsätze |
| author-letter |
Glazebrook, K. D. |
| doi_str_mv |
10.1007/BF02204822 |
| dewey-full |
004 |
| title_sort |
on the evaluation of strategies for branching bandit processes |
| title_auth |
On the evaluation of strategies for branching bandit processes |
| abstract |
Abstract Glazebrook [1] has given an account of improved procedures for strategy evaluation for resource allocation in a stochastic environment. These methods are extended in the paper in such a way that they can be applied to problems which, for example, have precedence constraints and/or an arrivals process of new jobs. Theoretical results, backed up by numerical studies, show that quasi-myopic heuristics often perform well. © J.C. Baltzer A.G. Scientific Publishing Company 1991 |
| abstractGer |
Abstract Glazebrook [1] has given an account of improved procedures for strategy evaluation for resource allocation in a stochastic environment. These methods are extended in the paper in such a way that they can be applied to problems which, for example, have precedence constraints and/or an arrivals process of new jobs. Theoretical results, backed up by numerical studies, show that quasi-myopic heuristics often perform well. © J.C. Baltzer A.G. Scientific Publishing Company 1991 |
| abstract_unstemmed |
Abstract Glazebrook [1] has given an account of improved procedures for strategy evaluation for resource allocation in a stochastic environment. These methods are extended in the paper in such a way that they can be applied to problems which, for example, have precedence constraints and/or an arrivals process of new jobs. Theoretical results, backed up by numerical studies, show that quasi-myopic heuristics often perform well. © J.C. Baltzer A.G. Scientific Publishing Company 1991 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_90 GBV_ILN_4029 |
| container_issue |
1 |
| title_short |
On the evaluation of strategies for branching bandit processes |
| url |
https://doi.org/10.1007/BF02204822 |
| remote_bool |
false |
| author2 |
Boys, R. J. Fay, N. A. |
| author2Str |
Boys, R. J. Fay, N. A. |
| ppnlink |
12964370X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/BF02204822 |
| up_date |
2024-07-04T08:46:09.673Z |
| _version_ |
1803637510294732800 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2111115800</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202342.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s1991 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF02204822</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111115800</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF02204822-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Glazebrook, K. D.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the evaluation of strategies for branching bandit processes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1991</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© J.C. Baltzer A.G. Scientific Publishing Company 1991</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Glazebrook [1] has given an account of improved procedures for strategy evaluation for resource allocation in a stochastic environment. These methods are extended in the paper in such a way that they can be applied to problems which, for example, have precedence constraints and/or an arrivals process of new jobs. Theoretical results, backed up by numerical studies, show that quasi-myopic heuristics often perform well.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bandit process</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gittins' index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Markov decision process</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">stopping time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">strategy evaluation</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Boys, R. J.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fay, N. A.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Baltzer Science Publishers, Baarn/Kluwer Academic Publishers, 1984</subfield><subfield code="g">30(1991), 1 vom: Dez., Seite 299-319</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:30</subfield><subfield code="g">year:1991</subfield><subfield code="g">number:1</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:299-319</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF02204822</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">30</subfield><subfield code="j">1991</subfield><subfield code="e">1</subfield><subfield code="c">12</subfield><subfield code="h">299-319</subfield></datafield></record></collection>
|
| score |
7.4025326 |