EAGER: Bounding Rationality by Computational Complexity

EAGER:计算复杂性限制理性

基本信息

  • 批准号:
    1255900
  • 负责人:
  • 金额:
    $ 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)
会议论文数量(0)
专利数量(0)

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ monograph.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ sciAawards.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ conferencePapers.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ patent.updateTime }}

Lance Fortnow其他文献

A tight lower bound for restricted pir protocols
  • DOI:
    10.1007/s00037-006-0208-3
  • 发表时间:
    2006-05-01
  • 期刊:
  • 影响因子:
    1.000
  • 作者:
    Richard Beigel;Lance Fortnow;William Gasarch
  • 通讯作者:
    William Gasarch
Separability and one-way functions
  • DOI:
    10.1007/s00037-002-0173-4
  • 发表时间:
    2002-06-01
  • 期刊:
  • 影响因子:
    1.000
  • 作者:
    Lance Fortnow;John D. Rogers
  • 通讯作者:
    John D. Rogers
Inseparability and Strong Hypotheses for Disjoint NP Pairs
  • DOI:
    10.1007/s00224-011-9326-7
  • 发表时间:
    2011-04-14
  • 期刊:
  • 影响因子:
    0.400
  • 作者:
    Lance Fortnow;Jack H. Lutz;Elvira Mayordomo
  • 通讯作者:
    Elvira Mayordomo
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
  • DOI:
    10.1007/s00224-008-9160-8
  • 发表时间:
    2008-12-17
  • 期刊:
  • 影响因子:
    0.400
  • 作者:
    Harry Buhrman;Lance Fortnow;Michal Koucký;John D. Rogers;Nikolay Vereshchagin
  • 通讯作者:
    Nikolay Vereshchagin
The power of adaptiveness and additional queries in random-self-reductions
  • DOI:
    10.1007/bf01202287
  • 发表时间:
    1994-06-01
  • 期刊:
  • 影响因子:
    1.000
  • 作者:
    Joan Feigenbaum;Lance Fortnow;Carsten Lund;Daniel Spielman
  • 通讯作者:
    Daniel Spielman

Lance Fortnow的其他文献

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

{{ truncateString('Lance Fortnow', 18)}}的其他基金

Instance Compression
实例压缩
  • 批准号:
    1338274
  • 财政年份:
    2012
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Standard Grant
TC: Small: Countering Location Spoofing Attacks: Multi-Model Architecture with Privacy-Enhancing Techniques
TC:小:反击位置欺骗攻击:采用隐私增强技术的多模型架构
  • 批准号:
    1115375
  • 财政年份:
    2011
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Standard Grant
ICES: Small: Collaborative Research: Algorithms and Mechanisms for Pricing, Influencing Dynamics, and Economic Optimization
ICES:小型:协作研究:定价、影响动态和经济优化的算法和机制
  • 批准号:
    1101283
  • 财政年份:
    2011
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Standard Grant
Instance Compression
实例压缩
  • 批准号:
    0829754
  • 财政年份:
    2008
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Standard Grant
Topics in Complexity Theory
复杂性理论主题
  • 批准号:
    9732922
  • 财政年份:
    1998
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Standard Grant
Presidential Faculty Fellow
总统教员研究员
  • 批准号:
    9253582
  • 财政年份:
    1992
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Continuing Grant
Probabilistic Computation and Interactive Proof Systems
概率计算和交互式证明系统
  • 批准号:
    9009936
  • 财政年份:
    1990
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Standard Grant

相似海外基金

Collaborative Research: Bounding global ice volumes over the last glacial cycle using reconstructions of Bering Strait flooding
合作研究:利用白令海峡洪水的重建来限制上一个冰川周期的全球冰量
  • 批准号:
    2327031
  • 财政年份:
    2023
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Standard Grant
The relationship between various jumping and running exercises suggests the most effective jumping "bounding" exercise.
各种跳跃和跑步练习之间的关系表明最有效的跳跃“弹跳”练习。
  • 批准号:
    22K11685
  • 财政年份:
    2022
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Grant-in-Aid for Scientific Research (C)
Implementing and testing new bounding methods for use in global optimization
实现和测试用于全局优化的新边界方法
  • 批准号:
    573946-2022
  • 财政年份:
    2022
  • 资助金额:
    $ 15.2万
  • 项目类别:
    University Undergraduate Student Research Awards
Bounding global ice volumes over the last glacial cycle using reconstructions of Bering Strait flooding
使用白令海峡洪水重建来限制上一个冰川周期的全球冰量
  • 批准号:
    2054757
  • 财政年份:
    2021
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Standard Grant
Collaborative Research: Bounding global ice volumes over the last glacial cycle using reconstructions of Bering Strait flooding
合作研究:利用白令海峡洪水的重建来限制上一个冰川周期的全球冰量
  • 批准号:
    2054780
  • 财政年份:
    2021
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Standard Grant
Analysis of bounding flight in birds by dynamic sparse modeling and its application to drones
动态稀疏建模分析鸟类弹跳飞行及其在无人机中的应用
  • 批准号:
    20K21008
  • 财政年份:
    2020
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Grant-in-Aid for Challenging Research (Exploratory)
Bounding heights of combinatorial trees
组合树的边界高度
  • 批准号:
    539343-2019
  • 财政年份:
    2019
  • 资助金额:
    $ 15.2万
  • 项目类别:
    University Undergraduate Student Research Awards
Bounding lengths of subgroup series for finite permutation and matrix groups
有限排列和矩阵群的子群级数的有界长度
  • 批准号:
    1935389
  • 财政年份:
    2017
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Studentship
Bounding the degree of permuation representations of quotient groups of finite permuation groups
限制有限排列群的商群的排列表示的次数
  • 批准号:
    1789299
  • 财政年份:
    2016
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Studentship
Development and analysis of practical application of damaged intervertebral disc treatment using advanced molecular engineering and bounding technology
利用先进的分子工程和绑定技术开发和分析受损椎间盘治疗的实际应用
  • 批准号:
    16K10823
  • 财政年份:
    2016
  • 资助金额:
    $ 15.2万
  • 项目类别:
    Grant-in-Aid for Scientific Research (C)
{{ showInfoDetail.title }}

作者:{{ showInfoDetail.author }}

知道了