Pages that link to "Item:Q5466501"

The following pages link to Automata, Languages and Programming (Q5466501):

Displaying 19 items.

• On the core of routing games with revenues (Q532673) (← links)
• Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
• Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
• The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
• Atomic routing games on maximum congestion (Q838146) (← links)
• The price of anarchy for polynomial social cost (Q861255) (← 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)
• Selfish routing with incomplete information (Q2471698) (← links)
• Mixed Nash equilibria in selfish routing problems with dynamic constraints (Q2481950) (← links)
• Efficiency of Equilibria in Uniform Matroid Congestion Games (Q2819451) (← links)
• Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions (Q4557738) (← links)
• (Q4737150) (← links)
• The Influence of Link Restrictions on (Random) Selfish Routing (Q5459969) (← 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)