TY - JOUR
T1 - To quit or to cruise? Modeling parking search decisions based on serious games
AU - Fulman, Nir
AU - Benenson, Itzhak
AU - Ben-Elia, Eran
N1 - Publisher Copyright:
Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
PY - 2020
Y1 - 2020
N2 - Knowing when a driver will quit cruising and either leave the area or park at an expensive off-street facility is critical for modeling parking search. We employ a serious game - PARKGAME for estimating the dynamics of drivers' decision making. 49 Participants of a game experiment were involved in three scenarios where they had to arrive on time to a fictional appointment or face monetary penalties, and to choose between uncertain but cheap on-street parking or a certain but costly parking lot. Scenarios diverged on the time to appointment and distance between the meeting place and parking lot locations. Players played a series of 8 or 16 computer games on a Manhattan grid road network with high on-street parking occupancy and nearby parking lot of unlimited capacity. Players' choices to quit or to continue search, as dependent on the search time, were analyzed with an accelerated-failure time (AFT) model. Results show that drivers are mostly risk-averse and quit on-street parking search very soon after potential loses begin to accumulate. The implications of game-based methods for simulation model development and sustainable parking policy are further discussed.
AB - Knowing when a driver will quit cruising and either leave the area or park at an expensive off-street facility is critical for modeling parking search. We employ a serious game - PARKGAME for estimating the dynamics of drivers' decision making. 49 Participants of a game experiment were involved in three scenarios where they had to arrive on time to a fictional appointment or face monetary penalties, and to choose between uncertain but cheap on-street parking or a certain but costly parking lot. Scenarios diverged on the time to appointment and distance between the meeting place and parking lot locations. Players played a series of 8 or 16 computer games on a Manhattan grid road network with high on-street parking occupancy and nearby parking lot of unlimited capacity. Players' choices to quit or to continue search, as dependent on the search time, were analyzed with an accelerated-failure time (AFT) model. Results show that drivers are mostly risk-averse and quit on-street parking search very soon after potential loses begin to accumulate. The implications of game-based methods for simulation model development and sustainable parking policy are further discussed.
UR - http://www.scopus.com/inward/record.url?scp=85093861292&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:85093861292
SN - 1613-0073
VL - 2701
SP - 24
EP - 30
JO - CEUR Workshop Proceedings
JF - CEUR Workshop Proceedings
T2 - 11th International Workshop on Agents in Traffic and Transportation, ATT 2020
Y2 - 4 September 2020
ER -