CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
unknown
基于进化博弈的网格资源分配方法的研究
Authors
林晓鹏
郭东辉
Publication date
15 March 2011
Publisher
Abstract
在网络资源优化分配问题的研究中,由于用户存在决策失误,现有基于理性用户博弈的网格资源分配在实际网格环境会完全失效。分析了非完全理性网格用户群体的资源分配策略及其演化过程,提出一种改进的复制动态机制的网格资源分配方法,克服了用户理性的限制,引入变异机制,在无初始学习样本的情况下,也能确保用户达到进行稳定策略点,实现了网格资源在有限理性用户之间的优化分配。仿真表明,用户通过学习对资源分配策略进行调整,可实现最优分配策略并处于稳定状态,证明了进化博弈的资源分配方法在网格环境中的适应性和稳定性
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Xiamen University Institutional Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dspace.xmu.edu.cn:2288/191...
Last time updated on 16/06/2016