MétaCan
Menu
Back to cohort
Record W4399939161 · doi:10.1109/tsmc.2024.3407836

Inverse Preference Optimization in the Graph Model for Conflict Resolution With Uncertain Cost

2024· article· en· W4399939161 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.
aboutThe title or abstract carries a Canadian signal from the geographic lexicon.

Bibliographic record

VenueIEEE Transactions on Systems Man and Cybernetics Systems · 2024
Typearticle
Languageen
FieldDecision Sciences
TopicGame Theory and Applications
Canadian institutionsUniversity of Waterloo
FundersNational Natural Science Foundation of China
KeywordsPreferenceInverseComputer scienceConflict resolutionGraphMathematical optimizationInverse problemResolution (logic)MathematicsTheoretical computer scienceArtificial intelligenceStatisticsPolitical science

Abstract

fetched live from OpenAlex

When a conflict occurs, the disputants involved and interested third parties usually expect to reach the desired equilibrium. To achieve this goal, inverse graph model for conflict resolution is an effective way to make the state of interest an equilibrium by ascertaining the required preferences. However, specifying crisp cost or effort of changing preferences over states can be challenging for decision makers (DMs) and third parties. As a result, a new inverse preference optimization model using interval optimization is introduced into the graph model by considering the uncertain cost of preference adjustment. First, the preference adjustment cost with uncertainty is formulated using interval number. Then, pessimistic preference ordering and DMs’ degrees of risk tolerance are utilized to compare cost intervals. After that, an inverse preference optimization model with uncertain adjustment cost is established. Finally, an illustrative example of the bulk water export conflict in Canada is presented to demonstrate the feasibility and effectiveness of the proposed 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: Empirical · Consensus signal: none
Teacher disagreement score0.985
Threshold uncertainty score0.721

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.0010.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.160
GPT teacher head0.335
Teacher spread0.175 · 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