IE interfaces (산업공학)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

Asset Buying Problem with Consideration of the Budget Constraints and Loan

예산 제약과 대출을 고려한 자산 매입 문제

  • Son, Jae-Dong (Department of Industrial and Information Systems Engineering Soongsil University)
  • 손재동 (숭실대학교 산업정보시스템공학과)
  • Received : 2011.08.29
  • Accepted : 2011.10.11
  • Published : 2011.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents a discrete time optimal asset buying problem with a predetermined final deadline where an available budget is limited. A cost is paid to search for assets called the search cost. A seller who shows up offers a price for the asset and then the buyer decides whether or not to buy the asset by comparing the offered price to his optimal selection threshold. When the budget becomes less than the search cost or the price of the asset the buyer can get a necessary loan with some interests. We clarify the properties of the buyer's optimal selection threshold in order to maximize the expected value of budget which is left after paying all the search costs and the price of the asset at that point in time.

Keywords

References

  1. Chun, Y. H. (1996), Selecting the best choice in the weighted secretary problem, European Journal of Operational Research, 92, 135-147. https://doi.org/10.1016/0377-2217(95)00045-3
  2. Ee, M. S. (2009), Asset-selling problem with an uncertain deadline, quitting offers, and search skipping, European Journal of Operations Research, 198, 215-222. https://doi.org/10.1016/j.ejor.2008.07.046
  3. Ikuta, S. (1988), Optimal stopping problem with uncertain recall, Journal of Operations Research Society of Japan, 38(1), 89-106.
  4. Ikuta, S. (2004), An integration of the optimal stopping problem and the optimal pricing problem. Discussion paper, No.1084, University of Tsukuba, Institute of Policy and Planning Sciences.
  5. Ikuta, S. (1992), The optimal stopping problem in which the sum of the accepted offer's value and the remaining search budget is an objective function, Journal of the Operations Research Society of Japan, 35(2), 172-193. https://doi.org/10.15807/jorsj.35.172
  6. Kang, B. K. (1999), Optimal stopping problem with recall cost, European Journal of Operations Research, 117(2), 222-238. https://doi.org/10.1016/S0377-2217(98)00013-7
  7. Karni, E. and Schwartz, A. (1977), Search theory: the case of search with uncertain recall, Journal of Economic Theory, 16, 38-52. https://doi.org/10.1016/0022-0531(77)90122-3
  8. Kohn, M. G. and Shavell, S. (1974), The theory of search, Journal of Economic Theory, 9, 93-123. https://doi.org/10.1016/0022-0531(74)90061-1
  9. Lippman, S. A. and McCardle, K. F. (1991), Uncertain search: A model of search among technologies of uncertain values, Management Science, 37, 1474-1490. https://doi.org/10.1287/mnsc.37.11.1474
  10. Morgan, P. and Manning, R. (1985), Optimal search, Econometrica, 53(4), 923- 944. https://doi.org/10.2307/1912661
  11. McCall, J. J. (1965), The economics of information and optimal stopping rules, Journal of Business, 300-317.
  12. Nakai, T. (1982), Optimal search for an object with a random lifetime, Journal of Operations Research Society of Japan, 25, 175-191. https://doi.org/10.15807/jorsj.25.175
  13. Saito, T. (1999), Optimal stopping problem with finite-period reservation, European Journal of Operations Research, 118, 605-619. https://doi.org/10.1016/S0377-2217(98)00318-X
  14. Ross, S. M. (1969), A problem in optimal search and stop, Operations Research, 17, 984-992. https://doi.org/10.1287/opre.17.6.984
  15. Weitzman, M. L. (1979), Optimal search for the best alternative, Econometrica, 47(3), 641-654. https://doi.org/10.2307/1910412
  16. Yanai, H. (1966), On a class of optimal stopping rule problems, Journal of Operations Research Society of Japan, 8(2), 66-90.