Pitfalls in Practical Open Multi Agent Argumentation Systems: Malicious Argumentation
Bibliographic record
Abstract
When an interaction mechanism such as argumentation is considered for use in open multi agent domains, such as E-Commerce or other business applications, it is necessary to consider the possibility of agents performing malicious actions. Common themes when studying malicious actions in communication protocols are that of withholding information and misrepresenting information. In argumentation, however, the use of a complex underlying formal logic allows for the possibility of another type of malicious action: the introduction of superfluous complexity into information, designed to overwhelm the reasoning capacity of another agent. We examine a malicious strategy in open multi agent systems based on exploiting the complexity of the formal logic underlying argumentation in order to manipulate the outcome of argument acceptability evaluation. Further, we briefly discuss the general problem of defensive strategies against this type of malicious argumentation, and the inherent difficulty in detecting occurrences of it.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.009 | 0.021 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.003 | 0.013 |
| Scholarly communication | 0.011 | 0.015 |
| Open science | 0.003 | 0.005 |
| Research integrity | 0.006 | 0.006 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".