The following pages link to (Q3409969):
Displaying 50 items.
- Selfish routing in public services (Q146294) (← links)
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- Egalitarian-utilitarian bounds in Nash's bargaining problem (Q266513) (← links)
- Worst-case analysis of non-cooperative load balancing (Q291317) (← links)
- Optimal cost sharing for capacitated facility location games (Q297094) (← links)
- Generalized Nash equilibria for SaaS/PaaS clouds (Q299907) (← links)
- Computation of equilibria and the price of anarchy in bottleneck congestion games (Q301322) (← links)
- Computational social choice for coordination in agent networks (Q314440) (← links)
- Strategic decentralization in binary choice composite congestion games (Q322512) (← links)
- On the performance of mildly greedy players in cut games (Q346481) (← links)
- Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
- Implementing efficient graphs in connection networks (Q382330) (← links)
- Load balancing via random local search in closed and open systems (Q383274) (← links)
- Social context congestion games (Q386894) (← links)
- On the hardness of network design for bottleneck routing games (Q389953) (← links)
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- Nash equilibria with minimum potential in undirected broadcast games (Q390911) (← links)
- Selfish bin packing with cardinality constraints (Q391143) (← links)
- Approximation algorithms for a bi-level knapsack problem (Q391212) (← links)
- Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
- Pricing with markups in industries with increasing marginal costs (Q403640) (← links)
- On the efficiency of price competition (Q408424) (← links)
- Selfish bin coloring (Q411255) (← links)
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- Strictly periodic scheduling in IMA-based architectures (Q438205) (← links)
- Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox (Q453657) (← links)
- Worst-case equilibria (Q458478) (← links)
- The \(k\)-server problem (Q458484) (← links)
- Some results of Christos Papadimitriou on internet structure, network routing, and web information (Q458485) (← links)
- Robust and scalable middleware for selfish-computer systems (Q465675) (← links)
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- The ring design game with fair cost allocation (Q476847) (← links)
- Strong stability of Nash equilibria in load balancing games (Q477108) (← links)
- LP-based covering games with low price of anarchy (Q493659) (← links)
- Price of anarchy for graph coloring games with concave payoff (Q501743) (← links)
- Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game (Q503156) (← links)
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness (Q503458) (← links)
- Profit sharing with thresholds and non-monotone player utilities (Q506517) (← links)
- Welfare guarantees for proportional allocations (Q506519) (← links)
- On the efficiency of the proportional allocation mechanism for divisible resources (Q506522) (← links)
- Network movement games (Q511922) (← links)
- The price of anarchy in bilateral network formation in an adversary model (Q521821) (← links)
- Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
- Selfish bin packing (Q534779) (← links)
- Coarse matching with incomplete information (Q535167) (← links)
- Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
- Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS (Q542097) (← links)
- Competitive cost sharing with economies of scale (Q547291) (← links)
- Connectivity and equilibrium in random games (Q549865) (← links)
- Nash equilibria in stabilizing systems (Q555314) (← links)
