scientific article
From MaRDI portal
Publication:3409969
zbMath1099.91501MaRDI QIDQ3409969
Elias Koutsoupias, Christos H. Papadimitriou
Publication date: 21 November 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noncooperative games (91A10) Special types of economic equilibria (91B52) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (only showing first 100 items - show all)
Egalitarian-utilitarian bounds in Nash's bargaining problem ⋮ Modelling web-service uncertainty: the angel/daemon approach ⋮ Worst-case analysis of non-cooperative load balancing ⋮ Strong equilibrium in cost sharing connection games ⋮ Stackelberg thresholds in network routing games or the value of altruism ⋮ The impact of local policies on the quality of packet routing in paths, trees, and rings ⋮ Ranking games ⋮ Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems ⋮ Optimal cost sharing for capacitated facility location games ⋮ On the complexity of constrained Nash equilibria in graphical games ⋮ The structure and complexity of Nash equilibria for a selfish routing game ⋮ Coordination mechanisms ⋮ Atomic routing games on maximum congestion ⋮ Generalized Nash equilibria for SaaS/PaaS clouds ⋮ Computation of equilibria and the price of anarchy in bottleneck congestion games ⋮ When ignorance helps: graphical multicast cost sharing games ⋮ Computational social choice for coordination in agent networks ⋮ Strategic decentralization in binary choice composite congestion games ⋮ The price of anarchy for polynomial social cost ⋮ On the performance of mildly greedy players in cut games ⋮ Utilitarian resource assignment ⋮ Nonpreemptive coordination mechanisms for identical machines ⋮ Implementing efficient graphs in connection networks ⋮ Load balancing via random local search in closed and open systems ⋮ On the structure and complexity of worst-case equilibria ⋮ Social context congestion games ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy ⋮ On the hardness of network design for bottleneck routing games ⋮ Maximizing the minimum load: the cost of selfishness ⋮ Nash equilibria with minimum potential in undirected broadcast games ⋮ Selfish bin packing with cardinality constraints ⋮ Approximation algorithms for a bi-level knapsack problem ⋮ Reducing price of anarchy of selfish task allocation with more selfishness ⋮ Pricing with markups in industries with increasing marginal costs ⋮ Decentralized subcontractor scheduling with divisible jobs ⋮ On the efficiency of price competition ⋮ Selfish bin coloring ⋮ The price of anarchy on uniformly related machines revisited ⋮ Inefficiency analysis of the scheduling game on limited identical machines with activation costs ⋮ Local and global price of anarchy of graphical games ⋮ Capacitated network design games ⋮ Congestion games with capacitated resources ⋮ Inefficiency of games with social context ⋮ The strong price of anarchy of linear bottleneck congestion games ⋮ On the performance of approximate equilibria in congestion games ⋮ Game-theoretic static load balancing for distributed systems ⋮ Strictly periodic scheduling in IMA-based architectures ⋮ Congestion games with failures ⋮ Tight bounds for selfish and greedy load balancing ⋮ Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox ⋮ Performance of one-round walks in linear congestion games ⋮ Worst-case equilibria ⋮ The \(k\)-server problem ⋮ Some results of Christos Papadimitriou on internet structure, network routing, and web information ⋮ Selfish bin covering ⋮ On the performances of Nash equilibria in isolation games ⋮ Robust and scalable middleware for selfish-computer systems ⋮ Selfish splittable flows and NP-completeness ⋮ The ring design game with fair cost allocation ⋮ Strong stability of Nash equilibria in load balancing games ⋮ Load balancing without regret in the bulletin board model ⋮ Design of price mechanisms for network resource allocation via price of anarchy ⋮ The price of anarchy of serial, average and incremental cost sharing ⋮ Scheduling to maximize participation ⋮ LP-based covering games with low price of anarchy ⋮ Cost sharing mechanisms for fair pricing of resource usage ⋮ Price of anarchy for graph coloring games with concave payoff ⋮ Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game ⋮ Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness ⋮ Profit sharing with thresholds and non-monotone player utilities ⋮ Welfare guarantees for proportional allocations ⋮ On the efficiency of the proportional allocation mechanism for divisible resources ⋮ Network movement games ⋮ A new model for selfish routing ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ The price of anarchy in bilateral network formation in an adversary model ⋮ Extending the notion of rationality of selfish agents: second order Nash equilibria ⋮ Non-cooperative facility location and covering games ⋮ Selfish bin packing ⋮ Coarse matching with incomplete information ⋮ How to find Nash equilibria with extreme total latency in network congestion games? ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS ⋮ Competitive cost sharing with economies of scale ⋮ Connectivity and equilibrium in random games ⋮ Game authority for robust and scalable distributed selfish-computer systems ⋮ The price of atomic selfish ring routing ⋮ Nash equilibria in stabilizing systems ⋮ Bayesian ignorance ⋮ Equilibria for networks with malicious users ⋮ Stackelberg strategies for atomic congestion games ⋮ Sensitivity of Wardrop equilibria ⋮ Strategic network formation through peering and service agreements ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ Network design with weighted players ⋮ Selfish routing in public services ⋮ Fragility of the commons under prospect-theoretic risk attitudes ⋮ Topological price of anarchy bounds for clustering games on networks ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines ⋮ Parametric packing of selfish items and the subset sum algorithm
This page was built for publication:
