IDEAS home Printed from https://ideas.repec.org/p/sek/iacpro/5007280.html
   My bibliography  Save this paper

Cross-modal Computer Games as an Interactive Learning Medium

Author

Listed:
  • Asadul Islam

    (Yasar University)

Abstract

Cross-modal computer games are boundless mediums for interactive learning in a visually and graphically simulated interactive sphere. Where the challenges and rewards for the users are constructed according to the increase in difficulty level. This paper will study about the significance of cross-modal based computer games for learning in the context of different visuals and sounds. As the computer games give the user a virtual platform with new learning experiences. In this method of learning the user becomes an independent learner. The computer games can draw player?s attention, team building, feedbacks, interest, time, self-confidence, and desire will also be explored in this research. Furthermore, this research will also explain the current issues faced in the game based learning with positive and negative aspects of this learning process. It will also explain about the different tools to analyze the game based learning. Hence, the game based learning in the curriculum is one of the very beneficial and engaging ways of the learning. It can make learning environment interactive for becoming an independent learner from a dependent learner.

Suggested Citation

  • Asadul Islam, 2017. "Cross-modal Computer Games as an Interactive Learning Medium," Proceedings of International Academic Conferences 5007280, International Institute of Social and Economic Sciences.
    • Handle: RePEc:sek:iacpro:5007280
    as

    Download full text from publisher

    File URL: https://iises.net/proceedings/30th-international-academic-conference-venice/table-of-content/detail?cid=50&iid=017&rid=7280
    File Function: First version, 2017
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    2. Dziubiński, Marcin & Goyal, Sanjeev & Minarsch, David E.N., 2021. "The strategy of conquest," Journal of Economic Theory, Elsevier, vol. 191(C).
    3. Kerry Back & Pierre Collin‐Dufresne & Vyacheslav Fos & Tao Li & Alexander Ljungqvist, 2018. "Activism, Strategic Trading, and Liquidity," Econometrica, Econometric Society, vol. 86(4), pages 1431-1463, July.
    4. Igor Rižnar & Klemen KavÄ iÄ, 2017. "Language management strategies and Slovenian SMEs," International Journal of Innovation and Learning, Inderscience Enterprises Ltd, vol. 21(2), pages 246-255.
    5. ., 2017. "Mixed income strategies," Chapters, in: Financing Nonprofits and Other Social Enterprises, chapter 9, pages 166-180, Edward Elgar Publishing.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    2. Evan Piermont, 2021. "Hypothetical Expected Utility," Papers 2106.15979, arXiv.org, revised Jul 2021.
    3. Wei He & Jiangtao Li & Weijie Zhong, 2024. "Rank-Guaranteed Auctions," Papers 2408.12001, arXiv.org.
    4. Pablo Guillen & Róbert F. Veszteg, 2021. "Strategy-proofness in experimental matching markets," Experimental Economics, Springer;Economic Science Association, vol. 24(2), pages 650-668, June.
    5. de Miguel-Arribas, A. & Morón-Vidal, J. & Floría, L.M. & Gracia-Lázaro, C. & Hernández, L. & Moreno, Y., 2024. "Contests in two fronts," Chaos, Solitons & Fractals, Elsevier, vol. 179(C).
    6. Loertscher, Simon & Mezzetti, Claudio, 2021. "A dominant strategy, double clock auction with estimation-based tatonnement," Theoretical Economics, Econometric Society, vol. 16(3), July.
    7. Josué Ortega & Erel Segal-Halevi, 2022. "Obvious manipulations in cake-cutting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(4), pages 969-988, November.
    8. Troyan, Peter, 2024. "(Non-)obvious manipulability of rank-minimizing mechanisms," Journal of Mathematical Economics, Elsevier, vol. 113(C).
    9. Markus Möller, 2024. "Transparent Matching Mechanisms," ECONtribute Discussion Papers Series 306, University of Bonn and University of Cologne, Germany.
    10. Moser, Johannes, 2018. "Hypothetical thinking and the winner's curse: An experimental investigation," VfS Annual Conference 2018 (Freiburg, Breisgau): Digital Economy 181506, Verein für Socialpolitik / German Economic Association.
    11. Breitmoser, Yves & Schweighofer-Kodritsch, Sebastian, 2019. "Obviousness around the clock," Discussion Papers, Research Unit: Market Behavior SP II 2019-203, WZB Berlin Social Science Center.
    12. Dasgupta, Amil & Fos, Vyacheslav & Sautner, Zacharias, 2021. "Institutional investors and corporate governance," LSE Research Online Documents on Economics 112114, London School of Economics and Political Science, LSE Library.
    13. Michela Chessa & Nobuyuki Hanaki & Aymeric Lardon & Takashi Yamada, 2022. "Cost of complexity in implementing the Shapley value by choosing a proposer through a bidding procedure," ISER Discussion Paper 1176, Institute of Social and Economic Research, Osaka University.
    14. Kevin Leyton-Brown & Paul Milgrom & Neil Newman & Ilya Segal, 2024. "Artificial Intelligence and Market Design: Lessons Learned from Radio Spectrum Reallocation," NBER Chapters, in: New Directions in Market Design, National Bureau of Economic Research, Inc.
    15. Breitmoser, Yves, 2019. "Knowing me, imagining you: Projection and overbidding in auctions," Games and Economic Behavior, Elsevier, vol. 113(C), pages 423-447.
    16. Shreya Bose & Ibrahim Ekren, 2020. "Kyle-Back Models with risk aversion and non-Gaussian Beliefs," Papers 2008.06377, arXiv.org, revised Oct 2022.
    17. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2023. "All sequential allotment rules are obviously strategy-proof," Theoretical Economics, Econometric Society, vol. 18(3), July.
    18. Tilman Börgers & Jiangtao Li, 2019. "Strategically Simple Mechanisms," Econometrica, Econometric Society, vol. 87(6), pages 2003-2035, November.
    19. Bilancini, Ennio & Boncinelli, Leonardo & Marcos-Prieto, Pablo, 2024. "Conflict initiation function shapes the evolution of persistent outcomes in group conflict," European Economic Review, Elsevier, vol. 161(C).
    20. Han, Jinhui & Li, Xiaolong & Ma, Guiyuan & Kennedy, Adrian Patrick, 2023. "Strategic trading with information acquisition and long-memory stochastic liquidity," European Journal of Operational Research, Elsevier, vol. 308(1), pages 480-495.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sek:iacpro:5007280. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Klara Cermakova (email available below). General contact details of provider: https://iises.net/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.