EAGER: Bounding Rationality by Computational Complexity
EAGER: Bounding Rationality by Computational Complexity
批准号:
1255900
负责人:
Lance Fortnow
金额:
$15.2万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2012
资助国家:
美国
项目状态:
已结题
起止时间:
2012-09-01 至 2014-08-31
中文摘要
人们做出选择,试图在众多选择中做出最好的选择,例如,在杂货店根据价格、价值和预算选择商品。有时候,选择真正最好的选项需要解决复杂的计算问题。经济理论大多忽略了这些计算问题,或者使用非常简单的计算成本模型。计算复杂性领域已经开发出复杂的模型来处理计算成本,本项目将把计算复杂性的模型和工具应用于经济情况。该项目将应用这些工具来回答各种问题,例如-我们如何为加密协议提供经济理由?我们如何为复杂的互动游戏(如国际象棋)建模?-人们如何从大量的可能性中做出选择(比如在大城市选择一家餐馆)?真随机数生成器和伪随机数生成器在经济上有区别吗?面对日益增长的互联网提供的大量选项和数据,人类有限的计算能力,甚至我们的计算机,都无法对最佳选择做出完整的分析。这项研究将产生大量的工具,这些工具将帮助我们了解我们决策能力的局限性,并指导我们在日益复杂的社会中做出选择所需的技术。
英文摘要
People make choices, trying to choose the best of many options, for example, choosing items at a grocery store based on their cost, value and their budget. Sometimes to choose the truly best option requires solving hard computational problems. Economic theory has mostly ignored these computational issues, or has used very simple cost models of computation. The field of computational complexity has developed sophisticated models for handling computational costs and this project will apply the models and tools from computational complexity to economic situations. The project will apply these tools to answer a variety of questions such as- How do we give an economic justification for a cryptographic protocol?- How do we model complex interactive games such as chess?- How do people choose from a large range of possibilities (such as choosing a restaurant in a large city)?- Is there an economic difference between true randomness and pseudorandom number generators?With the vast number of options and data that one has from the ever-growing Internet, the limited computational power of humans and even our computers cannot hope to give a complete analysis of the best choices. This research will generate a large number of tools that will help us understand the limits of our decision-making ability as well as guide the techniques we need to make choices in our ever-more-complex society.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Instance Compression
-
批准号:1338274
-
项目类别:Standard Grant
-
资助金额:$3.52万
-
财政年份:2012
-
负责人:Lance Fortnow
-
依托单位:
TC: Small: Countering Location Spoofing Attacks: Multi-Model Architecture with Privacy-Enhancing Techniques
-
批准号:1115375
-
项目类别:Standard Grant
-
资助金额:$50.0万
-
财政年份:2011
-
负责人:Lance Fortnow
-
依托单位:
ICES: Small: Collaborative Research: Algorithms and Mechanisms for Pricing, Influencing Dynamics, and Economic Optimization
-
批准号:1101283
-
项目类别:Standard Grant
-
资助金额:$18.53万
-
财政年份:2011
-
负责人:Lance Fortnow
-
依托单位:
Instance Compression
-
批准号:0829754
-
项目类别:Standard Grant
-
资助金额:$30.0万
-
财政年份:2008
-
负责人:Lance Fortnow
-
依托单位:
Topics in Complexity Theory
-
批准号:9732922
-
项目类别:Standard Grant
-
资助金额:$20.4万
-
财政年份:1998
-
负责人:Lance Fortnow
-
依托单位:
Presidential Faculty Fellow
-
批准号:9253582
-
项目类别:Continuing Grant
-
资助金额:$50.0万
-
财政年份:1992
-
负责人:Lance Fortnow
-
依托单位:
Probabilistic Computation and Interactive Proof Systems
-
批准号:9009936
-
项目类别:Standard Grant
-
资助金额:$3.69万
-
财政年份:1990
-
负责人:Lance Fortnow
-
依托单位:
海外基金