Optimal resource allocation among areas of equal value

John S. Croucher

Optimal resource allocation among areas of equal value

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

Abstract

This paper considers a two sided resource allocation game in which both players have a fixed number of indivisible units which must be distributed over areas of equal value. A restriction for both sides is that there is only a limited number of choices for the number of units which may be assigned to any given target. A method of solution is presented for the case in which both sides have up to three such choices, and an example is provided to illustrate the theory.

Original language	English
Pages (from-to)	80-91
Number of pages	11
Journal	Asia-Pacific Journal of Operational Research
Volume	4
Issue number	2
Publication status	Published - Jul 1976

Fingerprint Dive into the research topics of 'Optimal resource allocation among areas of equal value'. Together they form a unique fingerprint.

Cite this

@article{6a3c8a36a18949daab58cd005ddbb924,

title = "Optimal resource allocation among areas of equal value",

abstract = "This paper considers a two sided resource allocation game in which both players have a fixed number of indivisible units which must be distributed over areas of equal value. A restriction for both sides is that there is only a limited number of choices for the number of units which may be assigned to any given target. A method of solution is presented for the case in which both sides have up to three such choices, and an example is provided to illustrate the theory. ",

author = "Croucher, {John S.}",

year = "1976",

month = jul,

language = "English",

volume = "4",

pages = "80--91",

journal = "Asia-Pacific Journal of Operational Research",

issn = "0217-5959",

publisher = "World Scientific Publishing",

number = "2",

}

TY - JOUR

T1 - Optimal resource allocation among areas of equal value

AU - Croucher, John S.

PY - 1976/7

Y1 - 1976/7

N2 - This paper considers a two sided resource allocation game in which both players have a fixed number of indivisible units which must be distributed over areas of equal value. A restriction for both sides is that there is only a limited number of choices for the number of units which may be assigned to any given target. A method of solution is presented for the case in which both sides have up to three such choices, and an example is provided to illustrate the theory.

AB - This paper considers a two sided resource allocation game in which both players have a fixed number of indivisible units which must be distributed over areas of equal value. A restriction for both sides is that there is only a limited number of choices for the number of units which may be assigned to any given target. A method of solution is presented for the case in which both sides have up to three such choices, and an example is provided to illustrate the theory.

M3 - Article

VL - 4

SP - 80

EP - 91

JO - Asia-Pacific Journal of Operational Research

JF - Asia-Pacific Journal of Operational Research

SN - 0217-5959

IS - 2

ER -