Powered by OpenAIRE graph
Found an issue? Give us feedback
ZENODOarrow_drop_down
ZENODO
Article . 2026
License: CC BY
Data sources: Datacite
ZENODO
Article . 2026
License: CC BY
Data sources: Datacite
versions View all 2 versions
addClaim

The Algorithmic Consumer: A Conceptual Framework for Agentic AI in Predictive Marketing

Authors: Aliyu Mohammed; Abdullateef Ajibola Adepoju; Trimisiyu Omotayo Lawal;

The Algorithmic Consumer: A Conceptual Framework for Agentic AI in Predictive Marketing

Abstract

The core concepts of market transactions are being redefined as AI moves beyond reaction to self-autonomous software proxies. This paper proposes a conceptual framework of "Algorithmic Consumer," where the human buyer completely entrusts the purchasing decision, evaluation, and execution to Agentic AI. Although conventional marketing literature has described human actors interacting within choice architectures, using cognitive heuristics, emotional affect, and brand stories, agentic commerce invokes the dynamics of the machine interacting within choice architectures, maximizing utility. We synthesize the concepts of service-dominant logic, bounded rationality, agency theory, and cognitive offloading and apply them in the context of consumer behaviour, strategic management, and software engineering. Technical tricks, such as machine autonomy, recursive learning protocols, and genetic algorithms, are embedded and are used to show how the consumer proxies mathematically optimize preference profiles. Hence, a paradigm shift is needed in corporate strategy from CRM to Machine-to-Machine Relationship Management (M2MRM), and e-commerce becomes a field of programmatic and technical interoperability. Lastly, we critically review the "dark side" of delegation, discussing the double principal-agent problem, loss of consumer autonomy, algorithmic bias, and platform-level utility exploitation, and propose a strategic roadmap and an agenda for future empirical research. Keywords: Algorithmic Consumer, Agentic AI, Machine-to-Machine Relationship Management (M2MRM), Genetic Algorithms, Bounded Rationality, Service-Dominant Logic, Choice Delegation.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!