MétaCan
Menu
Back to cohort

On the Measurement of Negotiation Dialogue Games

2009· book-chapter· en· W103157384 on OpenAlexaff
Omar Marey, Abdeslam En‐Nouaary

Bibliographic record

VenueFrontiers in artificial intelligence and applications · 2009
Typebook-chapter
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsConcordia University
Fundersnot available
KeywordsNegotiationComputer scienceHuman–computer interactionPolitical scienceLaw

Abstract

fetched live from OpenAlex

Nowadays, multiagent systems became a widely used technology in everyday life. More studies are needed to evaluate these systems from different aspects such as evaluating agent dialogues, the participants to these dialogues, and the protocols governing the dialogues, etc. In this paper, we define new measures for dialogue games from an external agent's point of view. In particular, two measurement sets are proposed: in the first set, we use Shannon entropy to measure the certainty index of the dialogue. This involves i) using Shannon entropy to measure the agent's certainty about each move during the dialogue; and ii) using Shannon entropy to measure the certainty of the agents about the whole dialogue with two different ways. The first way is by taking the average of the certainty index of all moves, and the second way is by determining all possible dialogues and applying the general formula of Shannon entropy. In the second set, we introduce two metrics: i) measuring the goodness of the agents in the real dialogue (i.e. the dialogue that effectively happened between the participants); and ii) measuring the farness of the agents from the right dialogue (i.e. the best dialogue that can be produced by two agents if they know the knowledge bases of each other). Many dialogue game types have been proposed in multiagent systems. In this paper, we focus on one specific type, namely quantitative negotiation such as bargaining.

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 imitation

Not 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.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.019
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.019
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.004
Science and technology studies0.0010.003
Scholarly communication0.0040.006
Open science0.0020.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0040.001

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.

Opus teacher head0.065
GPT teacher head0.258
Teacher spread0.193 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations4
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueFrontiers in artificial intelligence and applicationsSame topicMulti-Agent Systems and NegotiationFrench-language works237,207