305
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Data-driven satisficing measure and ranking

Pages 456-474 | Received 19 Apr 2017, Accepted 24 Dec 2018, Published online: 25 Apr 2019

References

  • Armbruster, B., & Delage, E. (2015). Decision making under uncertainty when preference information is incomplete. Management Science, 61, 111–128. doi:10.1287/mnsc.2014.2059
  • Artzner, P., Delbaen, F., Eber, J.-M., & Heath, D. (1999). Coherent measures of risk. Mathematical Finance, 9, 203–228. doi:10.1111/1467-9965.00068
  • Bardou, O., Frikha, N., & Pages, G. (2009). Computing var and cvar using stochastic approximation and adaptive unconstrained importance sampling. Monte Carlo Methods and Applications, 15, 173–210. doi:10.1515/MCMA.2009.011
  • Ben-Tal, A., & Teboulle, M. (1986). Expected utility, penalty functions, and duality in stochastic nonlinear programming. Management Science, 32, 1445–1466. doi:10.1287/mnsc.32.11.1445
  • Ben-Tal, A., & Teboulle, M. (2007). An old-new concept of convex risk measures: The optimized certainty equivalent. Mathematical Finance, 17, 449–476. doi:10.1111/j.1467-9965.2007.00311.x
  • Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge, UK: Cambridge University Press.
  • Bradley, R. A., & Terry, M. E. (1952). Rank analysis of incomplete block designs the method of paired comparisons. Biometrika, 39, 324–345. doi:10.1093/biomet/39.3-4.324
  • Brown, D. B. (2006). Risk and robust optimization (PhD thesis). Massachusetts Institute of Technology.
  • Brown, D. B., Giorgi, E. D., & Sim, M. (2012). Aspirational preferences and their representation by risk measures. Management Science, 58, 2095–2113. doi:10.1287/mnsc.1120.1537
  • Brown, D. B., & Sim, M. (2009). Satisficing measures for analysis of risky positions. Management Science, 55, 71–84. doi:10.1287/mnsc.1080.0929
  • Bubeck, S. (2011). Introduction to online optimization. Lecture Notes, 1–86.
  • Carbonetto, P., Schmidt, M., & N. D, Freitas. (2009). An interior-point stochastic approximation method and an l1-regularized delta rule. In Advances in neural information processing systems (pp. 233–240), Vancouver, B.C., Canada.
  • Chen, H. (2012). The convergence rate of a regularized ranking algorithm. Journal of Approximation Theory, 164, 1513–1519. doi:10.1016/j.jat.2012.09.001
  • Chen, H., Tang, Y., Li, L., Yuan, Y., Li, X., & Tang, Y. (2013). Error analysis of stochastic gradient descent ranking. IEEE Transactions on Cybernetics, 43(3), 898–909. doi:10.1109/TSMCB.2012.2217957
  • Chen, L. G., Long, D. Z., & Perakis, G. (2014). The impact of a target on newsvendor decisions. Manufacturing & Service Operations Management, 17, 78–86. doi:10.1287/msom.2014.0500
  • Dai, Z., Li, D., & Wen, F. (2016). Worse-case conditional value-at-risk for asymmetrically distributed asset scenarios returns. Journal of Computational Analysis & Applications, 20, 237–251.
  • Dai, Z., & Wen, F. (2018). Some improved sparse and stable portfolio optimization problems. Finance Research Letters, 27, 46–52. doi:10.1016/j.frl.2018.02.026
  • De Giorgi, E. G., & Post, T. (2011). Loss aversion with a state-dependent reference point. Management Science, 57, 1094–1110. doi:10.1287/mnsc.1110.1338
  • Delage, E., & Li, J. Y. M. (2017). Minimizing risk exposure when the choice of a risk measure is ambiguous. Management Science, 64(1), 327–344. doi:10.1287/mnsc.2016.2593
  • Delage, E., & Ye, Y. (2010). Distributionally robust optimization under moment uncertainty with application to data-driven problems. Operations Research, 58, 595–612. doi:10.1287/opre.1090.0741
  • Duchi, J., Hazan, E., & Singer, Y. (2011). Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research, 12, 2121–2159. doi:10.1109/TNN.2011.2146788
  • Föllmer, H., & Knispel, T. (2013). Convex risk measures: Basic facts, law-invariance and beyond, asymptotics for large portfolios. Handbook of the Fundamentals of Financial Decision Making, Part II, p. 507–554. Singapore: World Scientific.
  • Föllmer, H., & Schied, A. (2011). Stochastic finance: An introduction in discrete time. Berlin: Walter de Gruyter.
  • Frey, J. C. (2007). New imperfect rankings models for ranked set sampling. Journal of Statistical Planning and Inference, 137, 1433–1445. doi:10.1016/j.jspi.2006.02.013
  • Ghahramani, Z. (2001). An introduction to hidden Markov models and Bayesian networks. International Journal of Pattern Recognition and Artificial Intelligence, 15, 9–42. doi:10.1142/S0218001401000836
  • Haslum, K., & Årnes, A. (2006). Multisensor real-time risk assessment using continuous-time hidden Markov models. IEEE International Conference on Computational Intelligence and Security, Guangzhou, China, 2, 1536–1540.
  • Homem-De-Mello, T. (2003). Variable-sample methods for stochastic optimization. ACM Transactions on Modeling and Computer Simulation (Simulation), 13, 108–133. doi:10.1145/858481.858483
  • Hu, J., Homem-de Mello, T., & Mehrotra, S. (2012). Sample average approximation of stochastic dominance constrained programs. Mathematical Programming, 133, 171–201. doi:10.1007/s10107-010-0428-9
  • Jiang, G., Fu, M. C., & Xu, C. (2015). Optimal importance sampling for simulation of Lévy processes. Paper presented at the Proceedings of the 2015 Winter Simulation Conference, p. 3813–3824. IEEE Press, Piscataway, NJ.
  • Kiefer, J., & Wolfowitz, J. (1952). Stochastic estimation of the maximum of a regression function. The Annals of Mathematical Statistics, 23, 462–466. doi:10.1214/aoms/1177729392
  • Kim, S., Pasupathy, R., and Henderson, S. G. (2015). A guide to sample average approximation. Handbook of simulation optimization (p. 207–243). New York: Springer.
  • Kőszegi, B., & Rabin, M. (2006). A model of reference-dependent preferences. The Quarterly Journal of Economics, 121, 1133–1165. doi:10.1093/qje/121.4.1133
  • Kriukova, G., Pereverzyev, S. V., & Tkachenko, P. (2016). On the convergence rate and some applications of regularized ranking algorithms. Journal of Complexity, 33, 14–29. doi:10.1016/j.jco.2015.09.004
  • Krokhmal, P., Palmquist, J., & Uryasev, S. (2002). Portfolio optimization with conditional value-at-risk objective and constraints. Journal of Risk, 4, 43–68. doi:10.21314/JOR.2002.057
  • Kushner, H., & G. G, Yin. (2003). Stochastic approximation and recursive algorithms and applications (Vol. 35). New York: Springer Science & Business Media.
  • Li, W., & Guo, Z. (2009). Hidden Markov model based real time network security quantification method. Paper presented at the IEEE International Conference on Networks Security, Wireless Communications and Trusted Computing (NSWCTC 09), Wuhan, China. volume 2, p. 94–100.
  • Liu, Y., Li, Y., & Hu, L. (2017). Departure time and route choices in bottleneck equilibrium under risk and ambiguity. Transportation Research Part B: Methodological, 23, 571–590. doi:10.1016/j.trb.2017.09.007
  • Luce, R. D. (2005). Individual choice behavior: A theoretical analysis. North Chelmsford, MA: Courier Corporation.
  • Mahdavi, M., Yang, T., & Jin, R. (2012). Online stochastic optimization with multiple objectives. arXiv, 1211, 6013.
  • Noyan, N., & Rudolf, G. (2013). Optimization with multivariate conditional value-at-risk constraints. Operations Research, 61, 990–1013. doi:10.1287/opre.2013.1186
  • Pal, A., He, Y., Jekel, M., Reinhard, M., & Gin, K. Y.-H. (2014). Emerging contaminants of public health significance as water quality indicator compounds in the urban water cycle. Environment International, 71, 46–62. doi:10.1016/j.envint.2014.05.025
  • Paltrinieri, N., Khan, F., Amyotte, P., & Cozzani, V. (2014). Dynamic approach to risk management: Application to the hoeganaes metal dust accidents. Process Safety and Environmental Protection, 92, 669–679. doi:10.1016/j.psep.2013.11.008
  • Postek, K., den Hertog, D., & Melenberg, B. (2016). Computationally tractable counterparts of distributionally robust constraints on risk measures. SIAM Review, 58(4), 603–650. doi:10.1137/151005221
  • Robbins, H., & Monro, S. (1951). A stochastic approximation method. The Annals of Mathematical Statistics, 22, 400–407.doi:10.1214/aoms/1177729586
  • Rockafellar, R. T., & Uryasev, S. (2000). Optimization of conditional value-at-risk. Journal of Risk, 2, 21–42. doi:10.21314/JOR.2000.038
  • Rockafellar, R. T., & Uryasev, S. (2013). The fundamental risk quadrangle in risk management, optimization and statistical estimation. Surveys in Operations Research and Management Science, 18, 33–53. doi:10.1016/j.sorms.2013.03.001
  • Ruszczynski, A., & Shapiro, A. (2006). Optimization of convex risk functions. Mathematics of Operations Research, 31, 433–452. doi:10.1287/moor.1050.0186
  • Sandoy, M., & Aven, T. (2006). Real time updating of risk assessments during a drilling operation-alternative Bayesian approaches. International Journal of Reliability, Quality and Safety Engineering, 13, 85–95. doi:10.1142/S0218539306002112
  • Shalev, J. (2000). Loss aversion equilibrium. International Journal of Game Theory, 29, 269–287. doi:10.1007/s001820000038
  • Shalev-Shwartz, S. (2011). Online learning and online convex optimization. Foundations and Trends in Machine Learning, 4, 107–194. doi:10.1561/2200000018
  • Shapiro, A. (2013). On kusuoka representation of law invariant risk measures. Mathematics of Operations Research, 38, 142–152. doi:10.1287/moor.1120.0563
  • Simon, H. A. (1955). A behavioral model of rational choice. The Quarterly Journal of Economics, 69, 99–118. doi:10.2307/1884852
  • Simon, H. A. (1959). Theories of decision-making in economics and behavioral science. The American Economic Review, 49, 253–283. doi:10.2307/1809901
  • Sugden, R. (2003). Reference-dependent subjective expected utility. Journal of Economic Theory, 111, 172–191. doi:10.1016/S0022-0531(03)00082-6
  • Tan, X., Zhang, Y., Cui, X., & Xi, H. (2008). Using hidden Markov models to evaluate the real-time risks of network. Paper presented at the IEEE International Symposium on Knowledge Acquisition and Modeling Workshop, Wuhan, China. p. 490–493.
  • Van Asselt, E., van der Spiegel, M., Noordam, M., Pikkemaat, M., & van der Fels-Klerx, H. (2013). Risk ranking of chemical hazards in fooda case study on antibiotics in the Netherlands. Food Research International, 54, 1636–1642. doi:10.1016/j.foodres.2013.08.042
  • Wang, W., & Ahmed, S. (2008). Sample average approximation of expected value constrained stochastic programs. Operations Research Letters, 36, 515–519. doi:10.1016/j.orl.2008.05.003
  • Weng, R. C., & Lin, C.-J. (2011). A bayesian approximation method for online ranking. The Journal of Machine Learning Research, 12, 267–300. doi:10.1080/00207179.2010.545079
  • Xu, L., & Yu, B. (2014). Cvar-constrained stochastic programming reformulation for stochastic nonlinear complementarity problems. Computational Optimization and Applications, 58, 483–501. doi:10.1007/s10589-013-9625-9
  • Yu-Ting, D., Hai-Peng, Q., & Xi-Long, T. (2014). Real-time risk assessment based on hidden Markov model and security configuration. Paper presented at the 2014 International Conference on Information Science, Electronics and Electrical Engineering (ISEEE), Sapporo City, Hokkaido, Japan, vol. 3, p. 1600–1603.
  • Zhang, C., & Wang, X. (2012). Health risk assessment of urban surface waters based on real-time PCR detection of typical pathogens. Human and Ecological Risk Assessment: An International Journal, 18, 329–337. doi:10.1080/10807039.2012.650585
  • Zhang, Y., & Cao, F. (2012). Analysis of convergence performance of neural networks ranking algorithm. Neural Networks, 34, 65–71. doi:10.1016/j.neunet.20212.06.012

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.