Analysis of Complexity and Time Restriction in Resources Allocation Problems

Kiyoshi Izumi (), Tomohisa Yamashita () and Koichi Kurumatani ()
Additional contact information
Kiyoshi Izumi: Information Technology Research Institute (ITRI), AIST & CREST, JST
Tomohisa Yamashita: ITRI, AIST & CREST, JST
Koichi Kurumatani: ITRI, AIST & CREST, JST

A chapter in The Complex Networks of Economic Interactions, 2006, pp 265-278 from Springer

Abstract: Summary In this paper, we constructed three types of agents, which are different in efficiency and accuracy of learning. They were compared using acquired payoff in a game-theoretic situation that is called Minority game. As a result, different types of learning methods got the highest payoff according to the complexity of environmental change and learning speed.

Keywords: Learning Method; Pattern Matcher; Agent Type; Resource Allocation Problem; Learning Speed (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-540-28727-8_18

Ordering information: This item can be ordered from
http://www.springer.com/9783540287278

DOI: 10.1007/3-540-28727-2_18

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().