scientific article
From MaRDI portal
Publication:3409969
zbMATH Open1099.91501MaRDI QIDQ3409969FDOQ3409969
Christos Papadimitriou, Elias Koutsoupias
Publication date: 21 November 2006
Title of this publication is not available (Why is that?)
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Noncooperative games (91A10) Special types of economic equilibria (91B52) Network design and communication in computer systems (68M10)
Cited In (only showing first 100 items - show all)
- Modelling web-service uncertainty: the angel/daemon approach
- A review of transport market modeling using game-theoretic principles
- On the price of anarchy of two-stage machine scheduling games
- The Influence of Link Restrictions on (Random) Selfish Routing
- Extending the notion of rationality of selfish agents: second order Nash equilibria
- The Price of Nash Equilibria in Multicast Transmissions Games
- Selfish load balancing for jobs with favorite machines
- Improved price of anarchy for machine scheduling games with coordination mechanisms
- Magnitude of inefficiency
- Equilibria for networks with malicious users
- Competitive Cost Sharing with Economies of Scale
- Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems
- The impact of local policies on the quality of packet routing in paths, trees, and rings
- On the complexity of constrained Nash equilibria in graphical games
- The price of anarchy for utilitarian scheduling games on related machines
- Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
- Nash equilibria in discrete routing games with convex latency functions
- Sharing Non-anonymous Costs of Multiple Resources Optimally
- Connectivity and equilibrium in random games
- Mean-field game approach to admission control of an \(M/M/\infty \) queue with shared service cost
- Bayesian ignorance
- A Unified Framework for Strong Price of Anarchy in Clustering Games
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
- Transportation network with externalities
- Two-terminal routing games with unknown active players
- Congestion Games with Complementarities
- Price of Anarchy in Networks with Heterogeneous Latency Functions
- Fragility of the commons under prospect-theoretic risk attitudes
- On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games
- Designing Networks with Good Equilibria under Uncertainty
- Linear tolls suffice: new bounds and algorithms for tolls in single source networks
- Sensitivity of Wardrop Equilibria
- Eisenberg-Gale markets: algorithms and game-theoretic properties
- Selfish versus unselfish optimization of network creation
- Mechanism design for set cover games with selfish element agents
- Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses
- Price of anarchy for parallel link networks with generalized mean objective
- Sensitivity of Wardrop equilibria
- Local and global price of anarchy of graphical games
- Game-theoretic static load balancing for distributed systems
- The Price of Stochastic Anarchy
- Topological price of anarchy bounds for clustering games on networks
- On the Price of Anarchy of Highly Congested Nonatomic Network Games
- Coordination mechanisms for scheduling selfish jobs with favorite machines
- Ranking games
- When Ignorance Helps: Graphical Multicast Cost Sharing Games
- The price of anarchy for polynomial social cost
- Bounding the inefficiency of the C-logit stochastic user equilibrium assignment
- Selfish bin covering
- A new model for selfish routing
- Sensitivity of wardrop equilibria: revisited
- On Stackelberg Strategies in Affine Congestion Games
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
- On the tree conjecture for the network creation game
- On the (In)efficiency of MFG Equilibria
- Recent studies of agent incentives in internet resource allocation and pricing
- Sequential scheduling on identical machines
- Non-atomic one-round walks in congestion games
- A unifying approximate potential for weighted congestion games
- Facets of the fully mixed Nash equilibrium conjecture
- A new lower bound on the price of anarchy of selfish bin packing
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- The Buck-Passing Game
- How to find Nash equilibria with extreme total latency in network congestion games?
- On Network Formation Games with Heterogeneous Players and Basic Network Creation Games
- Anarchy Is Free in Network Creation
- Online Learning of Nash Equilibria in Congestion Games
- Toll caps in privatized road networks
- A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis
- Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games
- Cost Sharing in Production Economies
- Tight inefficiency bounds for perception-parameterized affine congestion games
- Resilience of Routing in Parallel Link Networks
- Achieving target equilibria in network routing games without knowing the latency functions
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss
- Agent incentives of a proportional sharing mechanism in resource sharing
- Risk-based models for emergency shelter and exit design in buildings
- The Price of Stability of Weighted Congestion Games
- The Price of Stability of Weighted Congestion Games
- Bounding the inefficiency of compromise in opinion formation
- Scheduling to Maximize Participation
- Edge pricing of multicommodity networks for selfish users with elastic demands
- Strongly polynomial-time truthful mechanisms in one shot
- Linear-quadratic mean-field-type games: a direct method
- Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks
- Decentralized subcontractor scheduling with divisible jobs
- On cost sharing in the provision of a binary and excludable public good
- Collusion in Atomic Splittable Routing Games
- Capacitated network design games
- Inefficiency of games with social context
- A network pricing game for selfish traffic
- Price of anarchy in parallel processing
- The Curse of Sequentiality in Routing Games
- Multistage interval scheduling games
- Competitive contagion in networks
- Distributed Learning of Wardrop Equilibria
- Schelling games on graphs
- Evaluating the effect of sub-optimality
- Altruistic Hedonic Games
- Scheduling to maximize participation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3409969)