IDEAS home Printed from https://ideas.repec.org/a/alk/bjmss0/v3y2025i2id12310.html

Structured Elicitation Primitives for Reliable Multi-Agent Delegation and Recursive Planning

Author

Listed:
  • SUNIL KARTHIK KOTA

    (Engineering Leader, Software Architect, AI & Automation Expert)

Abstract

The transition of Large Language Models (LLMs) from passive information retrieval interfaces to agentic systems capable of multi-step execution represents a significant paradigm shift in artificial intelligence. However, the reliability of these agents is frequently compromised by stochastic drift, hallucination, and the inability to maintain coherent context over extended planning horizons. This paper proposes a theoretical framework for Reliable Agent Delegation (RAD), focusing on structured elicitation techniques that constrain the probabilistic output of foundation models into deterministic workflows. We analyze role assignment mechanisms, meta-reasoning prompts, and self-corrective failure recovery loops. Drawing upon existing literature in Chain-of-Thought (CoT) reasoning, ReAct frameworks, and formal verification, we posit that imposing rigid syntactic and semantic constraints on elicitation allows for verifiable delegation between orchestrator and worker agents. We discuss the security implications of such architectures, specifically regarding indirect prompt injection and cascading logic failures, and outline a methodology for constructing robust, self-healing agentic systems.

Suggested Citation

  • Sunil Karthik Kota, 2025. "Structured Elicitation Primitives for Reliable Multi-Agent Delegation and Recursive Planning," British Journal of Multidisciplinary Studies, Al-Kindi Center for Research and Development, vol. 3(2), pages 38-43, December.
  • Handle: RePEc:alk:bjmss0:v:3:y:2025:i:2:id:12310
    DOI: 10.32996/bjmss.2025.3.2.3
    as

    Download full text from publisher

    File URL: https://al-kindipublisher.com/index.php/bjmss/article/view/12310
    File Function: Abstract page
    Download Restriction: no

    File URL: https://al-kindipublisher.com/index.php/bjmss/article/download/12310/10992
    File Function: Full text
    Download Restriction: no

    File URL: https://libkey.io/10.32996/bjmss.2025.3.2.3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:alk:bjmss0:v:3:y:2025:i:2:id:12310. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Al-Kindi Center for Research and Development (email available below). General contact details of provider: https://al-kindipublisher.com/index.php/bjmss .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.