scientific article

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)

Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games ⋮ Improved Lower Bounds on the Price of Stability of Undirected Network Design Games ⋮ Bottleneck Congestion Games with Logarithmic Price of Anarchy ⋮ On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games ⋮ The complexity of welfare maximization in congestion games ⋮ Coordination Mechanisms for Selfish Parallel Jobs Scheduling ⋮ A Unified Framework for Strong Price of Anarchy in Clustering Games ⋮ Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ Strong equilibria in games with the lexicographical improvement property ⋮ On spectrum sharing games ⋮ Greedy distributed optimization of multi-commodity flows ⋮ Resilience of Routing in Parallel Link Networks ⋮ On the convergence of multicast games in directed networks ⋮ Worst-case Nash equilibria in restricted routing ⋮ Equilibrium computation of the Hart and Mas-Colell bargaining model ⋮ Collusion in atomic splittable routing games ⋮ Improved lower bounds on the price of stability of undirected network design games ⋮ A note on a selfish bin packing problem ⋮ On a generalized Cournot oligopolistic competition game ⋮ Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions ⋮ Competitive profit maximization in social networks ⋮ Scheduling selfish jobs on multidimensional parallel machines ⋮ Anarchy Is Free in Network Creation ⋮ On the Tree Conjecture for the Network Creation Game ⋮ Wary of the worst: maximizing award guarantees when new claimants may arrive ⋮ Network Creation Games: Think Global – Act Local ⋮ Robust market equilibria under uncertain cost ⋮ Sharing Non-anonymous Costs of Multiple Resources Optimally ⋮ The price of anarchy for utilitarian scheduling games on related machines ⋮ Agent incentives of a proportional sharing mechanism in resource sharing ⋮ An Incentive Mechanism for Selfish Bin Covering ⋮ Pareto optimal equilibria for selfish bin packing with uniform cost sharing ⋮ Using weight decision for decreasing the price of anarchy in selfish bin packing games ⋮ On equilibria for ADM minimization games ⋮ Efficiency analysis of load balancing games with and without activation costs ⋮ Selfish Transportation Games ⋮ The price of imperfect competition for a spanning network ⋮ A parametric worst-case approach to fairness in cooperative games with transferable utility ⋮ Influence in social networks with stubborn agents: from competition to bargaining ⋮ Inefficiency of Nash equilibria with parallel processing policy ⋮ Approximate strong equilibria in job scheduling games with two uniformly related machines ⋮ Algorithm for quadratic semi-assignment problem with partition size coefficients ⋮ Stability vs. optimality in selfish ring routing ⋮ The price of anarchy in an exponential multi-server ⋮ The worst absolute surplus loss in the problem of commons: random priority versus average cost ⋮ The toll effect on price of anarchy when costs are nonlinear and asymmetric ⋮ Bounding the inefficiency of Nash equilibria in games with finitely many players ⋮ Collusion in Atomic Splittable Routing Games ⋮ Selfish routing with incomplete information ⋮ Unnamed Item ⋮ On cost sharing in the provision of a binary and excludable public good ⋮ Mixed Nash equilibria in selfish routing problems with dynamic constraints ⋮ The effect of supplier capacity on the supply chain profit ⋮ Auctioning or assigning an object: some remarkable VCG mechanisms ⋮ Evolutionary equilibrium in Bayesian routing games: specialization and niche formation ⋮ Two-group knapsack game ⋮ How much can taxes help selfish routing? ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ A new lower bound on the price of anarchy of selfish bin packing ⋮ Tradeoffs in worst-case equilibria ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ Inoculation strategies for victims of viruses and the sum-of-squares partition problem ⋮ Multistage interval scheduling games ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms ⋮ The uniqueness property for networks with several origin-destination pairs ⋮ Service rate control of closed Jackson networks from game theoretic perspective ⋮ A Stackelberg strategy for routing flow over time ⋮ Optimal deterministic auctions with correlated priors ⋮ Selfish load balancing for jobs with favorite machines ⋮ The sequential price of anarchy for affine congestion games with few players ⋮ A geometric approach to the price of anarchy in nonatomic congestion games ⋮ Cache me if you can: capacitated selfish replication games in networks ⋮ Truthfulness for the Sum of Weighted Completion Times ⋮ Quality of strong equilibria for selfish bin packing with uniform cost sharing ⋮ Pathwise smooth splittable congestion games and inefficiency ⋮ On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games ⋮ Efficiency of Equilibria in Uniform Matroid Congestion Games ⋮ On the Price of Anarchy of Highly Congested Nonatomic Network Games ⋮ Designing Cost-Sharing Methods for Bayesian Games ⋮ Improved price of anarchy for machine scheduling games with coordination mechanisms ⋮ Interplay between Security Providers, Consumers, and Attackers: A Weighted Congestion Game Approach ⋮ On Network Formation Games with Heterogeneous Players and Basic Network Creation Games ⋮ The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates ⋮ Strategic network formation through an intermediary ⋮ On the efficiency of local electricity markets under decentralized and centralized designs: a multi-leader Stackelberg game analysis ⋮ Selfish Square Packing ⋮ Geometric spanner games ⋮ A survey on networking games in telecommunications ⋮ Structure and complexity of extreme Nash equilibria ⋮ Heterogeneity and chaos in congestion games ⋮ Adversarial behavior in network games ⋮ Linear tolls suffice: new bounds and algorithms for tolls in single source networks ⋮ Selfish unsplittable flows ⋮ Some anomalies of farsighted strategic behavior ⋮ Scheduling games on uniform machines with activation cost ⋮ Enforcing efficient equilibria in network design games via subsidies ⋮ On the structure of equilibria in basic network formation ⋮ On the sequential price of anarchy of isolation games

This page was built for publication: