Bibliographic record
Abstract
One thing that has been assumed for a long time is that whenever there is dominant strategy equilibrium in the game form of any mechanism and the outcome corresponding to that strategy profile is socially optimal, people will play that particular equilibrium strategy pro?le. The theory has been silent on why they will play that particular strategy pro?le when there are other (Nash) equilibria. The Nash/Bayes' Nash implementation being a possible solution to this problem suffers from the drawback of either the requirement of the designer knowing the (common) prior (in case of Bayes' Nash implementation) or the requirement of the players predicting the actions of other players and collaborate without pre-talk (in case of Nash implementation with absence of dominant strategy or unique Nash). Secure implementation [Saijo et al. (2007)] is a relatively new concept in the theory of mechanism design and implementation. This requires double implementation in Dominant Strategy Equilibrium and Nash Equi- librium by the same Mechanism. This concept has worked well in some particular environments and has been tested on data [Cason et al. (2006)]. Unsurprisingly, being stronger than both the two above said concepts of implementation, there are many impossibility results in specific environ- ments with richer domains. We look for secure implementability in pro- duction economies with divisible goods. We find that a very broad gener- alization of "Serial" Social Choice Function (SCF) [Moulin and Shenker (92)] as defined in [Shenker (92)] is securely implementable. We call such functions as Generalized Serial SCF (GSS). We also find that under cer- tain conditions the Fixed Path SCFs are special cases of GSS and thus they are also securely Implementable. We conjecture that these are the only securely impleme
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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.002 |
| 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".