The following pages link to (Q3524727):
Displaying 22 items.
- Computational social choice for coordination in agent networks (Q314440) (← links)
- Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
- Repeated congestion games with bounded rationality (Q444148) (← links)
- Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox (Q453657) (← links)
- Competitive routing over time (Q719282) (← links)
- The line planning routing game (Q1634301) (← links)
- Price of anarchy for highly congested routing games in parallel networks (Q1733382) (← links)
- Constraint games for stable and optimal allocation of demands in SDN (Q2009195) (← links)
- Delegation and ambiguity in correlated equilibrium (Q2078094) (← links)
- Heuristic optimization for multi-depot vehicle routing problem in ATM network model (Q2087124) (← links)
- Using inverse optimization to learn cost functions in generalized Nash games (Q2146979) (← links)
- A game-theoretic analysis of deep neural networks (Q2151381) (← links)
- Smart routing of electric vehicles for load balancing in smart grids (Q2203089) (← links)
- Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
- The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- On the Price of Anarchy of Highly Congested Nonatomic Network Games (Q2819452) (← links)
- Selfishness Need Not Be Bad (Q4994166) (← links)
- The Value of Information in Selfish Routing (Q5100972) (← links)
- An Online Learning Approach to a Multi-player N-armed Functional Bandit (Q5122324) (← links)
- When is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic (Q5131466) (← links)
- Online Learning of Nash Equilibria in Congestion Games (Q5252509) (← links)
