MétaCan
Menu
Back to cohort
Record W1977565211 · doi:10.1145/1160633.1160704

Negotiation coalitions in group-choice multi-agent systems

2006· article· en· W1977565211 on OpenAlexaff
Tom Wanyama, Behrouz H. Far

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldDecision Sciences
TopicAuction Theory and Applications
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsNegotiationComputer scienceSet (abstract data type)Order (exchange)Group (periodic table)Multi-agent systemSimilarity (geometry)WelfareGroup decision-makingOperations researchManagement scienceMicroeconomicsArtificial intelligenceBusinessEconomicsEngineering

Abstract

fetched live from OpenAlex

In Group-Choice Decision Making (GCDM) where a number of stakeholders are involved in choosing a single solution from a set of available solution options, it is common for the stakeholders to form coalitions during negotiations in order to increase their individual welfare. It is also common to use Multi-Agent Systems (MAS) to automate GCDM processes. In such MAS, agents have to form coalitions like their human counterparts. Within each coalition, the individual agents behave according to the strategies of their clients. In this paper we present a coalition formation model which can employ multiple coalition formation algorithms. The model is motivated by a real-world group-choice multi-agent system that we developed; in the system, agents can form coalitions dynamically based on the similarity between their preferences, and based on the ownership criteria. Finally, this paper presents simulation results that illustrate the operational effectiveness of our coalition formation model.

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.008
metaresearch head score (Gemma)0.018
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.041

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.018
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0030.004
Scholarly communication0.0040.006
Open science0.0020.005
Research integrity0.0030.002
Insufficient payload (model declined to judge)0.0050.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.131
GPT teacher head0.398
Teacher spread0.267 · 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 designSimulation or modeling
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

Citations9
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicAuction Theory and ApplicationsFrench-language works237,207