Howard, J. V.

Number of items: 10.
None
  • Alpern, Steve, Howard, J. V. (2019). A short solution to the many-player silent duel with arbitrary consolation prize. European Journal of Operational Research, 273(2), 646-649. https://doi.org/10.1016/j.ejor.2018.08.040
  • Howard, J. V., Timmer, Marco (2013). New results on rendezvous search on the interval. Naval Research Logistics, 60(6), 454-467. https://doi.org/10.1002/nav.21544
  • Howard, J. V. (2009). Significance testing with no alternative hypothesis: a measure of surprise. Erkenntnis, 70(2), 253-270. https://doi.org/10.1007/s10670-008-9148-4
  • Howard, John V. (2006). Countable additivity and the foundations of Bayesian statistics. Theory and Decision, 60(2-3), 127-135. https://doi.org/10.1007/s11238-005-4594-9
  • Howard, J. V., Gal, S. (2005). Rendezvous-evasion search in two boxes. Operations Research, 53(4), 689-697. https://doi.org/10.1287/opre.1040.0198
  • Alpern, Steven, Howard, J. V. (2000). Alternating search at two locations. Dynamics and Control, 10(4), 319-339. https://doi.org/10.1023/A:1011245715521
  • Alpern, Steven, Howard, John V. (1999). Alternating search at two locations. (Operational Research working papers LSEOR 99.30). Department of Operational Research, London School of Economics and Political Science.
  • Howard, J. V. (1999). Rendezvous search on the interval and the circle. Operations Research, 47(4), 550-588. https://doi.org/10.1287/opre.47.4.550
  • Howard, John V. (1992). A geometrical method of solving certain games. (Operational Research working papers LSEOR 92.3). Department of Operational Research, London School of Economics and Political Science.
    • Public
  • Gal, S., Howard, J. V. (2003). Rendezvous-evasion search in two boxes with incomplete information. (Operational Research working papers LSEOR 03.60). Department of Operational Research, London School of Economics and Political Science.