Skip to main content

Scaling invariance and a characterization of linear objective functions

Publication ,  Journal Article
Pekeč, S
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
October 31, 2011

A decision-maker who aims to select the "best" collection of alternatives from the finite set of available ones might be severely restricted in the design of the selection method. If the representation of valuations of available alternatives is subject to invariance under linear scaling, such as the choice of the unit of measurement, a sensible way to compare choices is to compare weighted sums of individual valuations corresponding to these choices. This scaling invariance, in conjunction with additional reasonable axioms, provides a characterization of linear 0-1 programming objective functions. The problem of finding an optimal subset of available data to be aggregated, allowing for use of different aggregation methods for different subsets of data, is also addressed. If the input data in the optimal aggregation problem are measured on a ratio scale and if the aggregation must be unanimous and symmetric, the arithmetic mean is the only sensible aggregation method. © 2011 Springer-Verlag.

Duke Scholars

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

Publication Date

October 31, 2011

Volume

6992 LNAI

Start / End Page

205 / 218

Related Subject Headings

  • Artificial Intelligence & Image Processing
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Pekeč, S. (2011). Scaling invariance and a characterization of linear objective functions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6992 LNAI, 205–218. https://doi.org/10.1007/978-3-642-24873-3_16
Pekeč, S. “Scaling invariance and a characterization of linear objective functions.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6992 LNAI (October 31, 2011): 205–18. https://doi.org/10.1007/978-3-642-24873-3_16.
Pekeč S. Scaling invariance and a characterization of linear objective functions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2011 Oct 31;6992 LNAI:205–18.
Pekeč, S. “Scaling invariance and a characterization of linear objective functions.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6992 LNAI, Oct. 2011, pp. 205–18. Scopus, doi:10.1007/978-3-642-24873-3_16.
Pekeč S. Scaling invariance and a characterization of linear objective functions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2011 Oct 31;6992 LNAI:205–218.

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

Publication Date

October 31, 2011

Volume

6992 LNAI

Start / End Page

205 / 218

Related Subject Headings

  • Artificial Intelligence & Image Processing