Pages that link to "Item:Q3581253"
From MaRDI portal
The following pages link to Near-optimal network design with selfish agents (Q3581253):
Displaying 38 items.
- Some results of Christos Papadimitriou on internet structure, network routing, and web information (Q458485) (← links)
- Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
- Selfish bin packing (Q534779) (← links)
- Price of stability in survivable network design (Q647493) (← links)
- On the performances of Nash equilibria in isolation games (Q652635) (← links)
- Network design with weighted players (Q733733) (← links)
- Strong equilibrium in cost sharing connection games (Q834855) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
- Stability in the self-organized evolution of networks (Q848641) (← links)
- Capacitated network design games (Q904684) (← links)
- The price of anarchy of serial, average and incremental cost sharing (Q934898) (← links)
- Good neighbors are hard to find: Computational complexity of network formation (Q934968) (← links)
- An efficient and almost budget balanced cost sharing method (Q993789) (← links)
- Almost budget-balanced VCG mechanisms to assign multiple objects (Q1001816) (← links)
- Non-cooperative tree creation (Q1017908) (← links)
- A network pricing game for selfish traffic (Q1954204) (← links)
- Introduction to computer science and economic theory (Q2253830) (← links)
- Two-group knapsack game (Q2268867) (← links)
- Geometric spanner games (Q2330124) (← links)
- On the sequential price of anarchy of isolation games (Q2354304) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- A contract-based model for directed network formation (Q2507673) (← links)
- Dynamics in tree formation games (Q2636765) (← links)
- Anarchy Is Free in Network Creation (Q2938033) (← links)
- The Price of Matching with Metric Preferences (Q3452808) (← links)
- Selfish Bin Packing (Q3541100) (← links)
- $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games (Q3599089) (← links)
- When Ignorance Helps: Graphical Multicast Cost Sharing Games (Q3599119) (← links)
- Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links (Q3639488) (← links)
- Mechanism and Network Design with Private Negative Externalities (Q4604896) (← links)
- Network investment games with Wardrop followers (Q5092358) (← links)
- Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games (Q5247620) (← links)
- On the Performances of Nash Equilibria in Isolation Games (Q5323044) (← links)
- The Price of Nash Equilibria in Multicast Transmissions Games (Q5387773) (← links)
- Competitive Cost Sharing with Economies of Scale (Q5458541) (← links)
- Approximate Strong Equilibrium in Job Scheduling Games (Q5459972) (← links)
- The Price of Anarchy of a Network Creation Game with Exponential Payoff (Q5459986) (← links)
