The following pages link to (Q3524728):
Displaying 21 items.
- Network-formation games with regular objectives (Q342715) (← links)
- Some results of Christos Papadimitriou on internet structure, network routing, and web information (Q458485) (← links)
- Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games (Q476904) (← links)
- A two-player competitive discrete location model with simultaneous decisions (Q613464) (← links)
- Mechanisms for (mis)allocating scientific credit (Q832517) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- The line planning routing game (Q1634301) (← links)
- Stochastic learning in multi-agent optimization: communication and payoff-based approaches (Q1716626) (← links)
- Strategic network formation through an intermediary (Q2322712) (← links)
- Privacy-constrained network formation (Q2411529) (← links)
- Evolution of social networks (Q2514759) (← links)
- Fault-Tolerant Aggregate Signatures (Q2798782) (← links)
- Convergence Dynamics of Graphical Congestion Games (Q2840915) (← links)
- Anarchy Is Free in Network Creation (Q2938033) (← links)
- The Web Graph as an Equilibrium (Q3449596) (← links)
- Grid Integration of Renewable Electricity and Distributed Control (Q4625778) (← links)
- Inequality and Network Formation Games (Q4985786) (← links)
- Value of Information in Bayesian Routing Games (Q4994147) (← links)
- Networks and Stability (Q5150303) (← links)
- On the α-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games (Q5321697) (← links)
