11 research outputs found
Achieving Maximum Utilization in Optimal Time for Learning or Convergence in the Kolkata Paise Restaurant Problem
The objective of the KPR agents are to learn themselves in the minimum
(learning) time to have maximum success or utilization probability (). A
dictator can easily solve the problem with in no time, by asking every
one to form a queue and go to the respective restaurant, resulting in no
fluctuation and full utilization from the first day (convergence time ). It has already been shown that if each agent chooses randomly the
restaurants, (where denotes the
Euler number) in zero time (). With the only available information
about yesterday's crowd size in the restaurant visited by the agent (as assumed
for the rest of the strategies studied here), the crowd avoiding (CA)
strategies can give higher values of but also of . Several numerical
studies of modified learning strategies actually indicated increased value of
for , with . We show here
using Monte Carlo technique, a modified Greedy Crowd Avoiding (GCA) Strategy
can assure full utilization () in convergence time ,
with of course non-zero probability for an even larger convergence time. All
these observations suggest that the strategies with single step memory of the
individuals can never collectively achieve full utilization () in finite
convergence time and perhaps the maximum possible utilization that can be
achieved is about eighty percent () in an optimal time of
order ten, even when the number of customers or of the restaurants goes to
infinity.Comment: 9 pages, 6 figures included in manuscript; Accepted for publication
in Indian Journal of Physic
Note on maximally entangled Eisert-Lewenstein-Wilkens quantum games
Maximally entangled Eisert-Lewenstein-Wilkens games are analyzed. For a
general class of gate operators defined in the previous papers of the first
author the general conditions are derived which allow to determine the form of
gate operators leading to maximally entangled games. The construction becomes
particularly simple provided one does distinguish between games differing by
relabelling of strategies. Some examples are presented.Comment: 20 pages, no figures, appendix added, references added, concluding
remarks extende
Eksistensi Kesetimbangan Nash pada Quantum Prisoners Dilemma untuk Dua Pemain Kuantum
Telah dikaji eksistensi kesetimbangan Nash pada quantum prisoners dilemma dengan efek dekoherensi. Kesetimbangan Nash diperoleh pada interval dekoherensi 0,622
Copyrights ©
2016 Copyrights ©
2016 </div
Collected Papers (on Neutrosophic Theory and Applications), Volume VIII
This eighth volume of Collected Papers includes 75 papers comprising 973 pages on (theoretic and applied) neutrosophics, written between 2010-2022 by the author alone or in collaboration with the following 102 co-authors (alphabetically ordered) from 24 countries: Mohamed Abdel-Basset, Abduallah Gamal, Firoz Ahmad, Ahmad Yusuf Adhami, Ahmed B. Al-Nafee, Ali Hassan, Mumtaz Ali, Akbar Rezaei, Assia Bakali, Ayoub Bahnasse, Azeddine Elhassouny, Durga Banerjee, Romualdas Bausys, Mircea Boșcoianu, Traian Alexandru Buda, Bui Cong Cuong, Emilia Calefariu, Ahmet Çevik, Chang Su Kim, Victor Christianto, Dae Wan Kim, Daud Ahmad, Arindam Dey, Partha Pratim Dey, Mamouni Dhar, H. A. Elagamy, Ahmed K. Essa, Sudipta Gayen, Bibhas C. Giri, Daniela Gîfu, Noel Batista Hernández, Hojjatollah Farahani, Huda E. Khalid, Irfan Deli, Saeid Jafari, Tèmítópé Gbóláhàn Jaíyéolá, Sripati Jha, Sudan Jha, Ilanthenral Kandasamy, W.B. Vasantha Kandasamy, Darjan Karabašević, M. Karthika, Kawther F. Alhasan, Giruta Kazakeviciute-Januskeviciene, Qaisar Khan, Kishore Kumar P K, Prem Kumar Singh, Ranjan Kumar, Maikel Leyva-Vázquez, Mahmoud Ismail, Tahir Mahmood, Hafsa Masood Malik, Mohammad Abobala, Mai Mohamed, Gunasekaran Manogaran, Seema Mehra, Kalyan Mondal, Mohamed Talea, Mullai Murugappan, Muhammad Akram, Muhammad Aslam Malik, Muhammad Khalid Mahmood, Nivetha Martin, Durga Nagarajan, Nguyen Van Dinh, Nguyen Xuan Thao, Lewis Nkenyereya, Jagan M. Obbineni, M. Parimala, S. K. Patro, Peide Liu, Pham Hong Phong, Surapati Pramanik, Gyanendra Prasad Joshi, Quek Shio Gai, R. Radha, A.A. Salama, S. Satham Hussain, Mehmet Șahin, Said Broumi, Ganeshsree Selvachandran, Selvaraj Ganesan, Shahbaz Ali, Shouzhen Zeng, Manjeet Singh, A. Stanis Arul Mary, Dragiša Stanujkić, Yusuf Șubaș, Rui-Pu Tan, Mirela Teodorescu, Selçuk Topal, Zenonas Turskis, Vakkas Uluçay, Norberto Valcárcel Izquierdo, V. Venkateswara Rao, Volkan Duran, Ying Li, Young Bae Jun, Wadei F. Al-Omeri, Jian-qiang Wang, Lihshing Leigh Wang, Edmundas Kazimieras Zavadskas