A new proof for Weber's characterization of the random order values

J. Derks

doi:10.1016/j.mathsocsci.2004.10.001

A new proof for Weber's characterization of the random order values

J. Derks^*

^*Corresponding author for this work

Department of Advanced Computing Sciences

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

This paper introduces an alternative proof for Weber's axiomatization of the random order values. In this proof, we make use of a combinatorial result that has recently been discussed by Vasil'ev [Vasil'ev, V.A., 2003. Extreme points of the Weber polyhedron. Discretnyi Analiz i Issledovaniye Operatsyi Ser.1, v.10, no. 2:17-55.]. In addition, we provide a new and intuitive proof for this combinatorial result.

Original language	English
Pages (from-to)	327-334
Number of pages	8
Journal	Mathematical Social Sciences
Volume	49
DOIs	https://doi.org/10.1016/j.mathsocsci.2004.10.001
Publication status	Published - 2005

Access to Document

10.1016/j.mathsocsci.2004.10.001

Cite this

@article{a0b43290026549e2a1ffde8b3b96d159,

title = "A new proof for Weber's characterization of the random order values",

abstract = "This paper introduces an alternative proof for Weber's axiomatization of the random order values. In this proof, we make use of a combinatorial result that has recently been discussed by Vasil'ev [Vasil'ev, V.A., 2003. Extreme points of the Weber polyhedron. Discretnyi Analiz i Issledovaniye Operatsyi Ser.1, v.10, no. 2:17-55.]. In addition, we provide a new and intuitive proof for this combinatorial result. ",

author = "J. Derks",

year = "2005",

doi = "10.1016/j.mathsocsci.2004.10.001",

language = "English",

volume = "49",

pages = "327--334",

journal = "Mathematical Social Sciences",

issn = "0165-4896",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - A new proof for Weber's characterization of the random order values

AU - Derks, J.

PY - 2005

Y1 - 2005

N2 - This paper introduces an alternative proof for Weber's axiomatization of the random order values. In this proof, we make use of a combinatorial result that has recently been discussed by Vasil'ev [Vasil'ev, V.A., 2003. Extreme points of the Weber polyhedron. Discretnyi Analiz i Issledovaniye Operatsyi Ser.1, v.10, no. 2:17-55.]. In addition, we provide a new and intuitive proof for this combinatorial result.

AB - This paper introduces an alternative proof for Weber's axiomatization of the random order values. In this proof, we make use of a combinatorial result that has recently been discussed by Vasil'ev [Vasil'ev, V.A., 2003. Extreme points of the Weber polyhedron. Discretnyi Analiz i Issledovaniye Operatsyi Ser.1, v.10, no. 2:17-55.]. In addition, we provide a new and intuitive proof for this combinatorial result.

U2 - 10.1016/j.mathsocsci.2004.10.001

DO - 10.1016/j.mathsocsci.2004.10.001

M3 - Article

SN - 0165-4896

VL - 49

SP - 327

EP - 334

JO - Mathematical Social Sciences

JF - Mathematical Social Sciences

ER -

A new proof for Weber's characterization of the random order values

Abstract

Access to Document

Fingerprint

Cite this