Evrimsel Oyun Teorisi Üzerine Bir Not

Date

2002-01-01

Author

Soytaş, Uğur

Metadata

Show full item record

Item Usage Stats

136
views

0
downloads

URI

https://hdl.handle.net/11511/83291

Journal

Abant İzzet Baysal Üniversitesi IIBF

Collections

Unverified, Article

Suggestions

OpenMETU
Core

A different approach to evolutionary ethics: from biology to society Aydın, Aysun; Sol, Ayhan; Department of Philosophy (2008) In this thesis I analyze the evolutionary ethics and propose a new perspective that develops on the notion of altruism. The view of evolutionary ethics, especially the sociobiological account, has some problems. The most important philosophical problem is the “is-ought” problem which refers to the question as to whether moral propositions can be inferred from factual statements. In order to overcome this problem I suggest a different reading of the notion of altruism namely “altruistic behavior practice” th...
A comparative study of evolutionary network design Kalkan, Sinan; Şehitoğlu, Onur Tolga; Üçoluk, Göktürk; Department of Computer Engineering (2003) In network design, a communication network is optimized for a given set of parameters like cost, reliability and delay. This study analyzes network design problem using Genetic Algorithms in detail and makes comparison of different approaches and representations. Encoding of a problem is one of the most crucial design choices in Genetic Algorithms. For network design problem, this study compares adjacency matrix representation with list of edges representation. Also, another problem is defining a fair fitne...
A comparative study of tree encodings for evolutionary computing Saka, Esin; Üçoluk, Göktürk; Department of Computer Engineering (2005) One of the most important factors on the success of evolutionary algorithms (EAs) about trees is the representation of them. The representation should exhibit efficiency, locality and heritability to enable effective evolutionary computing. Neville proposed three different methods for encoding labeled trees. The first one is similar with Prüfer's encoding. In 2001, it is reported that, the use of Prüfer numbers is a poor representation of spanning trees for evolutionary search, since it has low locality for...
Analysis of evolutionary algorithms for constrained routing problems / Demir, Erdem; Süral, Haldun; Department of Industrial Engineering (2004) This study focuses on two types of routing problems based on standard Traveling Salesman Problem, which are TSP with pickup and delivery (TSPPD) and TSP with backhauls (TSPB). In both of these problems, there are two types of customers, i.e. أdelivery customersؤ demanding goods from depot and أpickup customersؤ sending goods to depot. The objective is to minimize the cost of the tour that visits every customer once without violating the side constraints. In TSPB, delivery customers should precede the pickup...
Evrimsel oyun olarak kurumsal kontrol etkileşimi Soytaş, Uğur (2007-01-01) Yatırımcı ve hedef yönetim arasındaki kurumsal kontrol etkileşimini modellemek için oyun teorisi uygun bir araçtır. Ancak geleneksel oyun teorisi araçları genelde birden fazla Nash dengesini işaret etmektedir. Bu makalede Mason ve diğerlerinde (2003) yer alan asimetrik bilgili etap oyunu, evrimsel ve dinamik bir kurumsal kontrol oyunu olarak modellenmiştir. Geniş denge kümeleri yerine, evrimsel oyunun çözümünde olası kararlı durum olabilecek sekiz vaka bulunmuştur. Yakalardaki seçimlerin evrimsel kararlı st...

Citation Formats

U. Soytaş, “Evrimsel Oyun Teorisi Üzerine Bir Not,” Abant İzzet Baysal Üniversitesi IIBF, pp. 198–206, 2002, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/83291.