MétaCan
Menu
Back to cohort
Record W2038136293 · doi:10.1109/tem.2011.2169417

Optimization-Based Methods for Improving the Accuracy and Outcome of Learning in Electronic Procurement Negotiations

2011· article· en· W2038136293 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Engineering Management · 2011
Typearticle
Languageen
FieldDecision Sciences
TopicAuction Theory and Applications
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsNegotiationOutcome (game theory)ProcurementComputer scienceKnowledge managementFunction (biology)Artificial intelligenceEmpirical researchManagement scienceMachine learningOperations researchEngineeringBusinessMicroeconomicsMathematicsMarketing

Abstract

fetched live from OpenAlex

Empirical observations as well as theoretical analysis suggest that negotiation outcome in buyer-supplier situations can be improved by having accurate knowledge about the behavior of one's counterpart (i.e., negotiation partner). Yet, there is a paucity of research works dealing with the incorporation of learning methods into electronic procurement technologies, especially methods that can work with small amounts of information. This paper presents an application of nonlinear optimization for learning the parameters of a common negotiation decision function. Then, to show the usefulness of learning in a procurement-negotiation interaction, we outline a reaction algorithm that seeks to improve outcome. Detailed computational results with both the learning and reaction algorithms are conducted to demonstrate the viability of our approach.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.886
Threshold uncertainty score0.324

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.066
GPT teacher head0.356
Teacher spread0.290 · 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