A Multi-Attribute Auction Mechanism based on Conditional Constraints and Conditional Qualitative Preferences
Bibliographic record
Abstract
Auctioning multi-dimensional items is a key challenge, which requires rigorous tools. This study proposes a multi-round, first-score, semi-sealed multi-attribute reverse auction system. A fundamental concern in multiattribute auctions is acquiring a useful description of the buyers' individuated requirements: hard constraints and qualitative preferences. To consider real requirements, we express dependencies among attributes. Indeed, our system enables buyers eliciting conditional constraints as well as conditional preferences. However, determining the winner with diverse criteria may be very time consuming. Therefore, it is more useful for our auction to process quantitative data. A challenge here is to satisfy buyers with more facilities, and at the same time keep the auctions efficient. To meet this challenge, our system maps the qualitative preferences into a multi-criteria decision rule. It also completely automates the winner determination since it is a very difficult task for buyers to estimate quantitatively the attribute weights and define attributes value functions. Our procurement auction looks for the outcome that satisfies all the constraints and best matches the preferences. We demonstrate the feasibility and measure the time performance of the proposed system through a 10-attribute auction. Finally, we assess the user acceptance of our requirements specification and winner selection tool.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.015 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.003 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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 teacher head, 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".