Multi-agent Route Choice Game for Transportation Engineering
In undergraduate transportation engineering courses, traffic assignment is a difficult concept for both instructors to teach and for students to learn, because it involves many mathematical derivations and computations. We have designed a multiplayer game to engage students in the process of learning route choice, so that students can visualize how the traffic gradually reach user equilibrium (UE). For one scenario, we employ a Braess' Paradox, and explore the phenomenon during the game-play. We have done the case-control and before-after comparisons. The statistical results show that, students who played the game improve their understanding of the Braess' Paradox more than those who did not play. Among game players, younger students benefit more in their learning; while those who are not comfortable with exploring a phenomenon on their own think this game not as effective as those who prefer hands-on learning experiences.
|Date of creation:||2012|
|Date of revision:|
|Publication status:||Published in working paper|
|Contact details of provider:|| Postal: |
Phone: +01 (612) 625-6354
Fax: +01 (612) 626-7750
Web page: http://nexus.umn.edu
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:nex:wpaper:marc-game. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (David Levinson)
If references are entirely missing, you can add them using this form.