Pages that link to "Item:Q2570130"
From MaRDI portal
The following pages link to Structure and complexity of extreme Nash equilibria (Q2570130):
Displayed 15 items.
- Performance guarantees of jump neighborhoods on restricted related parallel machines (Q453054) (← links)
- Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- The price of anarchy for polynomial social cost (Q861255) (← links)
- On the structure and complexity of worst-case equilibria (Q883997) (← links)
- Cost sharing mechanisms for fair pricing of resource usage (Q943873) (← links)
- A new model for selfish routing (Q952441) (← links)
- Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
- Facets of the fully mixed Nash equilibrium conjecture (Q987401) (← links)
- How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
- Selfish routing with incomplete information (Q2471698) (← links)
- The Influence of Link Restrictions on (Random) Selfish Routing (Q5459969) (← links)
- Facets of the Fully Mixed Nash Equilibrium Conjecture (Q5459980) (← links)
- Computing Nash equilibria for scheduling on restricted parallel links (Q5917951) (← links)