Planning Method for Urban Subway Park-and-Ride Station and Parking Berth

For satisfying the growing demand of parking in urban area and relieving traffic congestion in downtown, under the condition of urban subway park-and-ride (P&R), the methods of site selection and scale calculation of parking lots are studied. Selecting Xi'an Rd. business circle in Dalian as study object, both survey and analysis of parking demand were conducted. Based on the principle of random equilibrium selection, the logit model of P&R demand was constructed. Then the forecasting models of parking demand both in downtown and peripheral zones were proposed respectively. Using the minimum travel distance of vehicles as the objective function, site selection optimization model of P&R station was constructed. The calculation methods of scale for parking lots in both downtown and P&R station were also processed. For the case of Xi'an Rd. business circle, not only the site of P&R station was planned, but the scale of parking berth was calculated. According to the plan and calculation, the total number of parking berth has increased from 3380 to 4011. Among the planned berths, 75.7 % are in the business circle and 24.3 % in P&R stations are outside downtown. Thus, the number of planned berths in the business circle has actually decreased by about 8 %. The research indicates that, for downtown with subway system, by reducing parking berths in downtown and increasing them in P&R stations outside the urban area, this planning method is more beneficial to relieve the problems of parking and traffic congestion in downtown than traditional method.

Coordination and Equilibrium Selection in Games: The Role of Local Effects

We study the role of local effects and finite size effects in reaching coordination and in equilibrium selection in two-player coordination games. We investigate three update rules – the replicator dynamics (RD), the best response (BR), and the unconditional imitation (UI). For the pure coordination game with two equivalent strategies we find a transition from a disordered state to coordination for a critical value of connectivity. The transition is system-size-independent for the BR and RD update rules. For the IU it is system-size-dependent, but coordination can always be reached below the connectivity of a complete graph. We also consider the general coordination game which covers a range of games, such as the stag hunt. For these games there is a payoff-dominant strategy and a risk-dominant strategy with associated states of equilibrium coordination. We analyse equilibrium selection analytically and numerically. For the RD and BR update rules mean-field predictions agree with simulations and the risk-dominant strategy is evolutionary favoured independently of local effects. When players use the unconditional imitation, however, we observe coordination in the payoff-dominant strategy. Surprisingly, the selection of pay-off dominant equilibrium only occurs below a critical value of the network connectivity and disappears in complete graphs. As we show, it is a combination of local effects and update rule that allows for coordination on the payoff-dominant strategy.

Strategic Robustness in Bi-level System-of-systems Design

Robust designs protect system utility in the presence of uncertainty in technical and operational outcomes. Systems-of-systems, which lack centralized managerial control, are vulnerable to strategic uncertainty from coordination failures between partially or completely independent system actors. This work assesses the suitability of a game-theoretic equilibrium selection criterion to measure system robustness to strategic uncertainty and investigates the effect of strategically robust designs on collaborative behavior. The work models interactions between agents in a thematic representation of a mobile computing technology transition using an evolutionary game theory framework. Strategic robustness and collaborative solutions are assessed over a range of conditions by varying agent payoffs. Models are constructed on small world, preferential attachment, and random graph topologies and executed in batch simulations. Results demonstrate that systems designed to reduce the impacts of coordination failure stemming from strategic uncertainty also increase the stability of the collaborative strategy by increasing the probability of collaboration by partners; a form of robustness by environment shaping that has not been previously investigated in design literature. The work also demonstrates that strategy selection follows the risk dominance equilibrium selection criterion and that changes in robustness to coordination failure can be measured with this criterion.

Delegation Using Forward Induction

This paper explores how delegation can be used as a signal to sustain cooperation. I consider a static principal–agent model with two tasks, one resembling a coordination game. If there is asymmetric information about the agent’s type, the principal with high private belief can delegate the first task as a signal. This is also supported by the forward induction argument. However, in the laboratory setting, this equilibrium is chosen only sometimes. When the subjects have information about past sessions, there is a significant increase in the use of delegation. This finding sheds light on equilibrium selection in Bayesian games.

Competing Conventions with Costly Information Acquisition

We consider an evolutionary model of social coordination in a 2 × 2 game where two groups of players prefer to coordinate on different actions. Players can pay a cost to learn their opponent’s group: if they pay it, they can condition their actions concerning the groups. We assess the stability of outcomes in the long run using stochastic stability analysis. We find that three elements matter for the equilibrium selection: the group size, the strength of preferences, and the information’s cost. If the cost is too high, players never learn the group of their opponents in the long run. If one group is stronger in preferences for its favorite action than the other, or its size is sufficiently large compared to the other group, every player plays that group’s favorite action. If both groups are strong enough in preferences, or if none of the groups’ sizes is large enough, players play their favorite actions and miscoordinate in inter-group interactions. Lower levels of the cost favor coordination. Indeed, when the cost is low, in inside-group interactions, players always coordinate on their favorite action, while in inter-group interactions, they coordinate on the favorite action of the group that is stronger in preferences or large enough.

Imitation and Local Interactions: Long Run Equilibrium Selection

In this paper, we analyze the long run dynamics of a multi-agent game played on a one-dimensional lattice with periodic boundary conditions, i.e., a ring. Agents repeatedly play a 2 × 2 coordination game with neighbors where the payoff dominant action and the risk dominant action are distinct. Necessary and sufficient conditions for both the actions to be the unique long run equilibrium are provided. The result is obtained through the application of the radius and modified coradius technique.