## A Formula for Incorporating Weights into Scoring Rules (1998)

### Cached

### Download Links

- [www.almaden.ibm.com]
- [www.almaden.ibm.com]
- [researcher.watson.ibm.com]
- DBLP

### Other Repositories/Bibliography

Venue: | Theoretical Computer Science |

Citations: | 16 - 1 self |

### BibTeX

@ARTICLE{Fagin98aformula,

author = {Ronald Fagin and Edward L. Wimmers},

title = {A Formula for Incorporating Weights into Scoring Rules},

journal = {Theoretical Computer Science},

year = {1998},

volume = {239},

pages = {309--338}

}

### Years of Citing Articles

### OpenURL

### Abstract

A "scoring rule" is an assignment of a value to every tuple (of varying sizes). This paper is concerned with the issue of how to modify a scoring rule to apply to the case where weights are assigned to the importance of each argument. We give an explicit formula for incorporating weights that can be applied no matter what the underlying scoring rule is. The formula is surprisingly simple, in that it involves far fewer terms than one might have guessed. It has three further desirable properties. The first desirable property is that when all of the weights are equal, then the result is obtained by simply using the underlying scoring rule. Intuitively, this says that when all of the weights are equal, then this is the same as considering the unweighted case. The second desirable property is that if a particular argument has zero weight, then that argument can be dropped without affecting the value of the result. The third desirable property is that the value of the result is a continuous ...