Network Latency in On-Line Gaming: An Engineering or a Psychological Problem?

被引:0
|
作者
Linehan, Conor [1 ]
Roche, Bryan [1 ]
McLoone, Seamus [2 ]
Ward, Tomas [2 ]
机构
[1] Natl Univ Ireland Maynooth, Dept Psychol, Maynooth, Kildare, Ireland
[2] Natl Univ Ireland Maynooth, Dept Elect Engn, Maynooth, Kildare, Ireland
基金
爱尔兰科学基金会;
关键词
Networked Multiplayer Games; Latency; Playability;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Ongoing research attempts to find engineering-based solutions to the problem of network latency in multiplayer computer games. However, few studies have been conducted to examine the end-users' experience of latency from a psychological perspective. The current study examines the roles of network latency and game complexity on the subjective experience of participants playing a specially designed computer game. Results suggest that participants prefer complex over simple games, regardless of the level of latency experienced. These findings suggest the possibility of a psychological solution to some of the negative effects of network latency. It is suggested that by manipulating Relational Complexity, it may be possible to maintain a satisfactory gaming experience in the presence of latency.
引用
收藏
页码:72 / +
页数:3
相关论文
共 50 条
  • [31] PROGRAMMING LANGUAGE FOR ON-LINE CONTROL OF PSYCHOLOGICAL EXPERIMENTS
    MILLENSO.JR
    BEHAVIORAL SCIENCE, 1971, 16 (03): : 248 - &
  • [32] Circular arc rigid line problem with loading on-line
    Chen, Y.Z.
    Journal of Applied Mechanics, Transactions ASME, 1998, 65 (03): : 776 - 778
  • [33] The on-line asymmetric traveling salesman problem
    Ausiello, G
    Bonifaci, V
    Laura, L
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2005, 3608 : 306 - 317
  • [34] The on-line asymmetric traveling salesman problem
    Ausiello, Giorgio
    Bonifaci, Vincenzo
    Laura, Luigi
    JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (02) : 290 - 298
  • [35] On-line algorithms for the dominating set problem
    Dept. of Comp. and Info. Science, National Chiao Tung University, Hsinchu 30050, Taiwan
    Inf. Process. Lett., 1 (11-14):
  • [36] On-line algorithms for the dominating set problem
    King, GH
    Tzeng, WG
    INFORMATION PROCESSING LETTERS, 1997, 61 (01) : 11 - 14
  • [37] The on-line Heilbronn's triangle problem
    Barequet, G
    DISCRETE MATHEMATICS, 2004, 283 (1-3) : 7 - 14
  • [38] On an on-line scheduling problem for parallel jobs
    Naroska, E
    Schwiegelshohn, U
    INFORMATION PROCESSING LETTERS, 2002, 81 (06) : 297 - 304
  • [39] Semi on-line algorithms for the partition problem
    Kellerer, H
    Kotov, V
    Speranza, MC
    Tuza, Z
    OPERATIONS RESEARCH LETTERS, 1997, 21 (05) : 235 - 242
  • [40] An on-line bin-batching problem
    Zhang, GC
    DISCRETE APPLIED MATHEMATICS, 2001, 108 (03) : 329 - 333