已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

On Decision Theory Under Competition

极小极大 数理经济学 随机博弈 对手 功能(生物学) 决策论 决策问题 博弈论 决策者 数学 完整信息 计算机科学 运筹学 算法 统计 进化生物学 生物
作者
James R. Jackson
出处
期刊:Management Science [Institute for Operations Research and the Management Sciences]
卷期号:15 (1): 12-32 被引量:6
标识
DOI:10.1287/mnsc.15.1.12
摘要

Decision theory treats models in which a decision maker must choose an information function and a decision function, where the former transforms states of nature into messages, the latter transforms messages into actions, and the ultimate payoff depends upon the state of nature, the message, and the action. This paper treats similar models in which nature's role is played by a selfseeking rational opponent. These models fall into the purview of the theory of two-person games, and the main results concern the maximin and minimax theories of these games. The various games treated differ in the assumptions made about the decision maker's ability to probability mix his choices and about his opponent's information concerning these choices. Twenty different sets of assumptions are considered, but it is shown that the maximin and minimax theories of the resulting games are all reducible in substance to those of just three games: (i) in which the decision maker cannot probability mix his choices at all, and his opponent observes both choices; (ii) in which the decision maker can mix arbitrarily, and his opponent observes neither of his choices; or (iii) in which the decision maker can mix decision functions only, and his opponent observes only the information function. These games are represented in terms of matrix games, and the matrices are compressed by the deletion of dominated strategies for the decision maker. Further compressions are obtained for the case in which the cost of information is separable from the payoff resulting from the actions of the decision maker and his opponent. The game matrices are finally reduced to manageable proportions for the further specialized cases in which either the capacity of the decision maker's information channel is significantly limited and information cost is constant, or the capacity of the information channel is large and there is one low—cost “non-message” available. A numerical example is given, and the concluding comments point to directions for further research.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
闪闪的梦柏完成签到 ,获得积分10
刚刚
HarryYang完成签到 ,获得积分10
刚刚
jh完成签到 ,获得积分10
1秒前
兜里没糖了完成签到 ,获得积分0
3秒前
心灵美语兰完成签到 ,获得积分10
3秒前
林业光魔发布了新的文献求助10
3秒前
小王好饿完成签到 ,获得积分10
3秒前
3秒前
南枝完成签到 ,获得积分10
3秒前
ouchiii完成签到,获得积分10
4秒前
夕立完成签到,获得积分10
5秒前
rick3455完成签到 ,获得积分10
6秒前
李健应助王瑾言采纳,获得10
6秒前
善良书南完成签到,获得积分20
7秒前
柒柒止步完成签到 ,获得积分10
8秒前
贝塔完成签到 ,获得积分10
10秒前
wangge完成签到,获得积分20
11秒前
11秒前
12秒前
小二郎应助dly采纳,获得10
13秒前
果果发布了新的文献求助10
16秒前
江枫渔火VC完成签到 ,获得积分10
16秒前
wangge发布了新的文献求助30
17秒前
小鸟芋圆露露完成签到 ,获得积分10
17秒前
嘉欣完成签到 ,获得积分10
20秒前
dongtan完成签到 ,获得积分10
20秒前
28秒前
七七完成签到 ,获得积分10
32秒前
飞快的奇异果完成签到 ,获得积分10
32秒前
春江发布了新的文献求助10
32秒前
问筠关注了科研通微信公众号
33秒前
穆紫月懒阳阳完成签到,获得积分10
34秒前
35秒前
39秒前
科研通AI5应助崔志玥采纳,获得10
39秒前
JC完成签到,获得积分10
40秒前
SciGPT应助果果采纳,获得10
40秒前
40秒前
张培元完成签到,获得积分10
41秒前
春江完成签到,获得积分10
41秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Acute Mountain Sickness 2000
Handbook of Milkfat Fractionation Technology and Application, by Kerry E. Kaylegian and Robert C. Lindsay, AOCS Press, 1995 1000
A novel angiographic index for predicting the efficacy of drug-coated balloons in small vessels 500
Textbook of Neonatal Resuscitation ® 500
The Affinity Designer Manual - Version 2: A Step-by-Step Beginner's Guide 500
Affinity Designer Essentials: A Complete Guide to Vector Art: Your Ultimate Handbook for High-Quality Vector Graphics 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 内科学 生物化学 物理 计算机科学 纳米技术 遗传学 基因 复合材料 化学工程 物理化学 病理 催化作用 免疫学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 5063184
求助须知:如何正确求助?哪些是违规求助? 4286873
关于积分的说明 13358002
捐赠科研通 4104880
什么是DOI,文献DOI怎么找? 2247686
邀请新用户注册赠送积分活动 1253213
关于科研通互助平台的介绍 1184234