The following pages link to STACS 2004 (Q5309730):
Displaying 17 items.
- Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
- Selfish bin packing (Q534779) (← 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)
- Utilitarian resource assignment (Q866544) (← 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)
- Stackelberg strategies for atomic congestion games (Q987387) (← links)
- Congestion games with linearly independent paths: convergence time and price of anarchy (Q987402) (← links)
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation (Q2268863) (← links)
- Selfish routing with incomplete information (Q2471698) (← links)
- Mixed Nash equilibria in selfish routing problems with dynamic constraints (Q2481950) (← links)
- Selfish unsplittable flows (Q2581267) (← links)
- Selfish Bin Packing (Q3541100) (← links)
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy (Q5459970) (← links)
- Facets of the Fully Mixed Nash Equilibrium Conjecture (Q5459980) (← links)
