Optimal Sequential Selection and Resource Allocation under Uncertainty

Consider a decision-maker who is in charge of a number of activities. At each of a sequence of decision points in time, he selects--on the basis of their performance--the set of activities to be continued further and allocates his limited resources among them. Activities receiving larger allocations...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:Advances in Applied Probability. - Applied Probability Trust. - 12(1980), 4, Seite 942-957
1. Verfasser: Chikte, Shirish D. (VerfasserIn)
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 1980
Zugriff auf das übergeordnete Werk:Advances in Applied Probability
Schlagworte:Optimal stochastic resource allocation Optimal selection Random walk Markov decision theory Mathematics Applied sciences Business Behavioral sciences Philosophy
LEADER 01000caa a22002652 4500
001 JST000688312
003 DE-627
005 20240619091250.0
007 cr uuu---uuuuu
008 150322s1980 xx |||||o 00| ||eng c
024 7 |a 10.2307/1426750  |2 doi 
035 |a (DE-627)JST000688312 
035 |a (JST)1426750 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Chikte, Shirish D.  |e verfasserin  |4 aut 
245 1 0 |a Optimal Sequential Selection and Resource Allocation under Uncertainty 
264 1 |c 1980 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
520 |a Consider a decision-maker who is in charge of a number of activities. At each of a sequence of decision points in time, he selects--on the basis of their performance--the set of activities to be continued further and allocates his limited resources among them. Activities receiving larger allocations tend to improve their performance, while others receiving smaller allocations tend to deteriorate. We present a controlled random walk model for the progress of these activities. The problem of maximizing the net infinite horizon discounted return is formulated in the framework of Markov decision theory, and existence of optimal strategies established. It is shown that both the optimal selection and allocation strategies exhibit a 'favoring the leaders' behavior. Finally, explicit solutions to certain special cases are obtained illustrating these results. 
540 |a Copyright 1980 Applied Probability Trust 
650 4 |a Optimal stochastic resource allocation 
650 4 |a Optimal selection 
650 4 |a Random walk 
650 4 |a Markov decision theory 
650 4 |a Mathematics  |x Applied mathematics  |x Game theory  |x Strategic behavior  |x Optimal strategies 
650 4 |a Applied sciences  |x Computer science  |x Computer programming  |x Mathematical programming  |x Dynamic programming 
650 4 |a Mathematics  |x Applied mathematics  |x Statistics  |x Random walk 
650 4 |a Mathematics  |x Pure mathematics  |x Probability theory  |x Random variables  |x Stochastic processes  |x Markov processes 
650 4 |a Mathematics  |x Pure mathematics  |x Linear algebra  |x Vector analysis  |x Mathematical vectors 
650 4 |a Business  |x Accountancy  |x Financial accounting  |x Budgeting  |x Budget allocation 
650 4 |a Behavioral sciences  |x Psychology  |x Cognitive psychology  |x Decision theory 
650 4 |a Mathematics  |x Pure mathematics  |x Probability theory  |x Stochastic models  |x Markov models 
650 4 |a Philosophy  |x Logic  |x Logical topics  |x Formal logic  |x Mathematical logic  |x Mathematical set theory  |x Mathematical sets 
650 4 |a Mathematics  |x Applied mathematics  |x Statistics  |x Applied statistics  |x Descriptive statistics  |x Statistical distributions  |x Distribution functions  |x Probability distributions  |x Discrete probability distributions  |x Probability mass distributions 
655 4 |a research-article 
773 0 8 |i Enthalten in  |t Advances in Applied Probability  |d Applied Probability Trust  |g 12(1980), 4, Seite 942-957  |w (DE-627)269247009  |w (DE-600)1474602-5  |x 00018678  |7 nnns 
773 1 8 |g volume:12  |g year:1980  |g number:4  |g pages:942-957 
856 4 0 |u https://www.jstor.org/stable/1426750  |3 Volltext 
856 4 0 |u https://doi.org/10.2307/1426750  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_JST 
912 |a GBV_ILN_11 
912 |a GBV_ILN_20 
912 |a GBV_ILN_22 
912 |a GBV_ILN_24 
912 |a GBV_ILN_31 
912 |a GBV_ILN_39 
912 |a GBV_ILN_40 
912 |a GBV_ILN_60 
912 |a GBV_ILN_62 
912 |a GBV_ILN_63 
912 |a GBV_ILN_65 
912 |a GBV_ILN_69 
912 |a GBV_ILN_70 
912 |a GBV_ILN_90 
912 |a GBV_ILN_100 
912 |a GBV_ILN_110 
912 |a GBV_ILN_285 
912 |a GBV_ILN_374 
912 |a GBV_ILN_702 
912 |a GBV_ILN_2001 
912 |a GBV_ILN_2003 
912 |a GBV_ILN_2005 
912 |a GBV_ILN_2006 
912 |a GBV_ILN_2007 
912 |a GBV_ILN_2008 
912 |a GBV_ILN_2009 
912 |a GBV_ILN_2010 
912 |a GBV_ILN_2011 
912 |a GBV_ILN_2014 
912 |a GBV_ILN_2015 
912 |a GBV_ILN_2018 
912 |a GBV_ILN_2020 
912 |a GBV_ILN_2021 
912 |a GBV_ILN_2026 
912 |a GBV_ILN_2027 
912 |a GBV_ILN_2044 
912 |a GBV_ILN_2050 
912 |a GBV_ILN_2056 
912 |a GBV_ILN_2057 
912 |a GBV_ILN_2061 
912 |a GBV_ILN_2088 
912 |a GBV_ILN_2107 
912 |a GBV_ILN_2110 
912 |a GBV_ILN_2190 
912 |a GBV_ILN_2938 
912 |a GBV_ILN_2947 
912 |a GBV_ILN_2949 
912 |a GBV_ILN_2950 
912 |a GBV_ILN_4012 
912 |a GBV_ILN_4035 
912 |a GBV_ILN_4037 
912 |a GBV_ILN_4046 
912 |a GBV_ILN_4112 
912 |a GBV_ILN_4126 
912 |a GBV_ILN_4242 
912 |a GBV_ILN_4251 
912 |a GBV_ILN_4305 
912 |a GBV_ILN_4306 
912 |a GBV_ILN_4307 
912 |a GBV_ILN_4313 
912 |a GBV_ILN_4322 
912 |a GBV_ILN_4323 
912 |a GBV_ILN_4325 
912 |a GBV_ILN_4335 
912 |a GBV_ILN_4346 
912 |a GBV_ILN_4392 
912 |a GBV_ILN_4393 
912 |a GBV_ILN_4700 
951 |a AR 
952 |d 12  |j 1980  |e 4  |h 942-957