scientific article; zbMATH DE number 2086616
From MaRDI portal
Publication:4737150
zbMath1056.68028MaRDI QIDQ4737150
Dimitris Fotakis, Marios Mavronicolas, Elias Koutsoupias, Paul G. Spirakis, Spyros C. Kontogiannis
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800123.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Special types of economic equilibria (91B52) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Logic programming (68N17)
Related Items (46)
Some results of Maria Serna on strategic games: complexity of equilibria and models ⋮ Optimal cost sharing for capacitated facility location games ⋮ On the complexity of constrained Nash equilibria in graphical games ⋮ Atomic routing games on maximum congestion ⋮ On the convergence of multicast games in directed networks ⋮ Worst-case Nash equilibria in restricted routing ⋮ Inverse Game Theory: Learning Utilities in Succinct Games ⋮ Collusion in atomic splittable routing games ⋮ The price of anarchy for polynomial social cost ⋮ Utilitarian resource assignment ⋮ Nonpreemptive coordination mechanisms for identical machines ⋮ On the structure and complexity of worst-case equilibria ⋮ Reducing price of anarchy of selfish task allocation with more selfishness ⋮ Equilibria in a class of aggregative location games ⋮ Designing fast converging cost sharing methods for multicast transmissions ⋮ Characterizing the existence of potential functions in weighted congestion games ⋮ Selfish Bin Packing ⋮ Equilibria problems on games: complexity versus succinctness ⋮ On best response dynamics in weighted congestion games with polynomial delays ⋮ Scheduling to maximize participation ⋮ Cost sharing mechanisms for fair pricing of resource usage ⋮ Deterministic monotone algorithms for scheduling on related machines ⋮ A new model for selfish routing ⋮ Selfish routing with incomplete information ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ Extending the notion of rationality of selfish agents: second order Nash equilibria ⋮ Selfish bin packing ⋮ Mixed Nash equilibria in selfish routing problems with dynamic constraints ⋮ Evolutionary equilibrium in Bayesian routing games: specialization and niche formation ⋮ Game-theoretic analysis of Internet switching with selfish users ⋮ Facets of the fully mixed Nash equilibrium conjecture ⋮ Scheduling to Maximize Participation ⋮ Load rebalancing games in dynamic systems with migration costs ⋮ Computing Nash equilibria for scheduling on restricted parallel links ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ The Price of Anarchy on Uniformly Related Machines Revisited ⋮ Facets of the Fully Mixed Nash Equilibrium Conjecture ⋮ Pure Nash equilibria in player-specific and weighted congestion games ⋮ Project games ⋮ Fair cost-sharing methods for scheduling jobs on parallel machines ⋮ How hard is it to find extreme Nash equilibria in network congestion games? ⋮ Nash equilibria in all-optical networks ⋮ Equilibria in load balancing games ⋮ Structure and complexity of extreme Nash equilibria ⋮ Machine load balancing game with linear externalities ⋮ Selfish unsplittable flows
This page was built for publication:
