scientific article; zbMATH DE number 1446122

MaRDI QIDQ4953797zbMATH OpenFDO

Authors Martin J. Beckmann

Publication date 21 May 2000

zbMATH Keywords

2-person gamesmixed strategiespure strategies

Mathematics Subject Classification ID

2-person games (91A05) (n)-person games, (n>2) (91A06) Noncooperative games (91A10)

Review text

The problem of looking for research funds is modelled by a 2-person game. Two applicants (players) compete for a fund \(F\). Each of them invests a certain effort \(x\). When the probability of obtaining the revenue is proportional to it the game has a solution in pure strategies. If we use other inputs in the competition (curriculum, prestige, etc) the chance of winning changes. The author derives the optimal pure strategy . The weight of the efforts may be seriously reduced if other aspects enter into consideration. The optimal strategy for mixed strategies is also analysed. The payoff of player 1 is defined as \(F \operatorname {prob}(y<x)-x\). The mixed strategies and the optimal rule are derived. The analysis of an \(n\)-person game is also studied. For the entire collection see [Zbl 0930.00096].

Recommendations

• Bidding for money
• scientific article; zbMATH DE number 3932780
• Bidding for Contests
• Bidding for incentive contracts
• Alternative resources for funding and supporting undergraduate research
• A model of privately funded public research

Cited in

(2)

• Analyzing the efficient allocation of research funds by Bayesian model
• scientific article; zbMATH DE number 3932780 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953797)