Skip to content
Log inStart free

Design paper

Conversion as a system outcome: a design for behavioural optimisation under constraints

Abstract

Conversion optimisation is usually practised at the level of a page: change a button, run an A/B test, keep the winner. We argue that conversion is better treated as an outcome of the whole commerce system, shaped by intent, friction, delivery promises, payment reliability and trust, and we describe a design built on that view. A behavioural optimisation model senses events, derives intent, friction and trust signals, estimates the effect of candidate treatments per customer group, and chooses among them with contextual bandits that operate under exposure, latency and consent constraints and a conservative rule for learning from logged data. We set out the evaluation framework the design would need, the questions it raises, and the limits of what it can claim. This is a design proposal, not a measured result.

Method. Design paper: the architecture is argued from the cited literature; we report no measurements of our own. Table 1 lists the metrics an evaluation would use, how each would be measured, and its source.

References

  1. 1

    Kohavi, R., Tang, D., & Xu, Y. (2020). Trustworthy online controlled experiments: A practical guide to A/B testing. Cambridge University Press. doi.org/10.1017/9781108653985

  2. 2

    Gefen, D., Karahanna, E., & Straub, D. W. (2003). Trust and TAM in online shopping: An integrated model. MIS Quarterly. doi.org/10.2307/30036519

  3. 3

    Lambrecht, A., & Tucker, C. (2013). When does retargeting work? Information specificity in online advertising. Journal of Marketing Research. doi.org/10.1509/jmr.11.0503

  4. 4

    Athey, S., & Imbens, G. (2016). Recursive partitioning for heterogeneous causal effects. Proceedings of the National Academy of Sciences. doi.org/10.1073/pnas.1510489113

  5. 5

    Agarwal, A., Hsu, D., Kale, S., Langford, J., Li, L., & Schapire, R. E. (2014). Taming the monster: A fast and simple algorithm for contextual bandits. Proceedings of the 31st International Conference on Machine Learning (arXiv). arxiv.org/abs/1402.0555

  6. 6

    Kallus, N., & Zhou, A. (2018). Confounding-robust policy improvement. Advances in Neural Information Processing Systems 31 (arXiv). arxiv.org/abs/1805.08593

  7. 7

    Patil, V., Ghalme, G., Nair, V., & Narahari, Y. (2021). Achieving fairness in the stochastic multi-armed bandit problem. Journal of Machine Learning Research, 22. jmlr.org/papers/v22/20-704.html

  8. 8

    Mehrabi, N., Morstatter, F., Saxena, N., Lerman, K., & Galstyan, A. (2021). A survey on bias and fairness in machine learning. ACM Computing Surveys. doi.org/10.1145/3457607

  9. 9

    Johari, R., Koomen, P., Pekelis, L., & Walsh, D. (2017). Peeking at A/B tests: Why it matters, and what to do about it. Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. doi.org/10.1145/3097983.3097992

  10. 10

    Deng, A., Xu, Y., Kohavi, R., & Walker, T. (2013). Improving the sensitivity of online controlled experiments by utilizing pre-experiment data. Proceedings of the Sixth ACM International Conference on Web Search and Data Mining. doi.org/10.1145/2433396.2433413

  11. 11

    Dwork, C., & Roth, A. (2014). The algorithmic foundations of differential privacy. Foundations and Trends in Theoretical Computer Science. doi.org/10.1561/0400000042

Cite this paper

Tanqory Research (2025). Conversion as a system outcome: a design for behavioural optimisation under constraints. Tanqory. https://tanqory.com/research/20251230-conversion-system-outcome-behavioral-optimization

More research

All research