Papers in Refereed Journals

 

  1. Ross, S.M. and Lin, K.Y. 1999.  A pseudo counterexample to a simulation metatheorem.  Probability in the Engineering and Informational Sciences 13(3) 329-332.

2.     Ross, S.M. and Lin, K.Y. 2001.  Applying variance reduction ideas in queueing simulations.  Probability in the Engineering and Informational Sciences 15(4) 481-494.

3.     Lin, K.Y. and Ross, S.M. 2003.  Admission control with incomplete information of a queueing system.  Operations Research 51(4) 645-654.

4.     Lin, K.Y. 2003.  Decentralized admission control of a queueing system: A game-theoretic model.  Naval Research Logistics 50(7) 702-718.

5.     Lin, K.Y. and Ross S.M. 2004.  Optimal admission control for a single server loss queue.  Journal of Applied Probability 41(2) 535-546.

6.     Lin, K.Y. 2004.  A sequential dynamic pricing model and its applications.  Naval Research Logistics 51(4) 501-521.

7.     Tseng, C., Lin, K.Y. and Sundararajan, S.K. 2005.  Managing cost overrun risk in project funding allocation.  Annals of Operations Research 135(1) 127-153.

8.     Lin, K.Y. 2006.  Dynamic pricing with real-time demand learning.  European Journal of Operational Research 174(1) 522-538.

9.     Tseng, C. and Lin, K.Y. 2007.  A framework using two-factor price lattices for generation asset valuation.  Operations Research 55(2) 234-251.

10.  Bish, E.K., Lin, K.Y. and Hong, S. 2008.  Allocation of flexible and indivisible resources with decision postponement and demand learning.  European Journal of Operational Research 187(2) 429-441.

11.  Szechtman, R., Kress, M., Lin, K.Y., and Cfir, D. 2008.  Models of sensor operations for border surveillance. Naval Research Logistics 55(1) 27-41.

12.  Sibdari, S., Lin, K.Y., and Chellappan, S. 2008. Multiproduct revenue management: An empirical study of Auto Train at Amtrak. Journal of Revenue and Pricing Management 7(2) 172-184.

13.  Lennon C., McGowan J., and Lin, K.Y. 2008. A game-theoretic model for repeated assignment problem between two selfish agents. Journal of the Operational Research Society 59(12) 1652-1658.

14.  Kress, M., Lin, K.Y., and Szechtman, R. 2008. Optimal discrete search with imperfect specificity. Mathematical Methods of Operations Research 68(3) 539-549.

15.  Lin, K.Y., Kress, M., and Szechtman, R. 2009. Scheduling policies for an antiterrorist surveillance system. Naval Research Logistics 56(2) 113-126.

16.  Lin, K.Y. and Sibdari, S. 2009. Dynamic price competition with discrete customer choices. European Journal of Operational Research 197(3) 969-980.

17.  Kao, C., Robertson, C., Kragh, F. and Lin, K.Y. 2011. Performance analysis and simulations of 32-ary cyclic code-shift keying. International Journal of Communication Systems 24(2) 258-268.

18.  Lin, K.Y. and Wei, Y.  2011. Optimal probing control for wireless transmission when the payload is negligible.  Optimal Control Applications and Methods 32 558-573

19.  Lin, K.Y., Dayton J. 2011. Game-theoretic models for jamming radio-controlled improvised explosive devices.  Military Operations Research 16(3) 5-13.

20.  Lin, K.Y., Atkinson, M.P., Chung, T.H., and Glazebrook, K.D. 2013. A graph patrol problem with random attack times. Operations Research 61(3) 694-710.

21.  Lin, K.Y. 2014. New results on a stochastic duel game with each force consisting of heterogeneous units. Naval Research Logistics 61(1) 56-65.

22.  Lin, K.Y. and MacKay, N.J. 2014. The optimal policy for the one-against-many heterogeneous Lanchester model, Operations Research Letters 42(6) 473-477.

23.  Lin, K.Y., Atkinson, M.P., Glazebrook, K.D. 2014. Optimal patrol to uncover threats in time when detection is imperfect, Naval Research Logistics 61(8) 557-576.

 

 

Google Scholar page

 

Return to Kyle Lin's homepage