Repeated parking problems are decision making situations under uncertainty in environments where agents’ scores are affected by the actions of others. The repeated parking problem is considered as a game of N agents who adapt their parking strategies over time based on their individual experiences and preferences. Each agent is assigned a unique profile characterized by a parking arrival time and a parking missing risk, which impacts strategy selection. The agent-based model was implemented in NetLogo to investigate emergent phenomena and adaptive decision-making. The simulation integrates probabilistic elements, including Beta-distributed arrival times. A scoring function evaluates performance by combining parking success rates with arrival times, enabling comparative analysis of strategy effectiveness across agents.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Agent-Based Simulation of Repeated Parking Problem Inspired by El Farol Bar Model

  • Michal Michna,
  • Milan Kořínek,
  • Kamila Štekerová

摘要

Repeated parking problems are decision making situations under uncertainty in environments where agents’ scores are affected by the actions of others. The repeated parking problem is considered as a game of N agents who adapt their parking strategies over time based on their individual experiences and preferences. Each agent is assigned a unique profile characterized by a parking arrival time and a parking missing risk, which impacts strategy selection. The agent-based model was implemented in NetLogo to investigate emergent phenomena and adaptive decision-making. The simulation integrates probabilistic elements, including Beta-distributed arrival times. A scoring function evaluates performance by combining parking success rates with arrival times, enabling comparative analysis of strategy effectiveness across agents.