scientific article; zbMATH DE number 2119691

From MaRDI portal
Publication:4828962

zbMath1092.91508MaRDI QIDQ4828962

Berthold Vöcking, Artur Czumaj

Publication date: 29 November 2004


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

The shortest first coordination mechanism for a scheduling game with parallel-batching machinesStrong equilibrium in cost sharing connection gamesOn the complexity of constrained Nash equilibria in graphical gamesCoordination mechanismsAtomic routing games on maximum congestionOptimal Coordination Mechanisms for Unrelated Machine SchedulingThe Price of Matching with Metric PreferencesWorst-case Nash equilibria in restricted routingOn the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demandsThe price of anarchy for polynomial social costUtilitarian resource assignmentNonpreemptive coordination mechanisms for identical machinesAnarchy Is Free in Network CreationOn the structure and complexity of worst-case equilibriaCoordination mechanisms for parallel machine schedulingEquilibria for two parallel links: the strong price of anarchy versus the price of anarchyNon-preemptive Coordination Mechanisms for Identical Machine Scheduling GamesEfficiency analysis of load balancing games with and without activation costsA network pricing game for selfish trafficTight bounds for selfish and greedy load balancingNon-clairvoyant scheduling gamesInefficiency of Nash equilibria with parallel processing policyWorst-case equilibriaStrong stability of Nash equilibria in load balancing gamesLoad balancing without regret in the bulletin board modelScheduling to maximize participationThe toll effect on price of anarchy when costs are nonlinear and asymmetricApproximate Strong Equilibrium in Job Scheduling GamesSelfish bin packingMixed Nash equilibria in selfish routing problems with dynamic constraintsHow to find Nash equilibria with extreme total latency in network congestion games?Connectivity and equilibrium in random gamesEvolutionary equilibrium in Bayesian routing games: specialization and niche formationTwo-group knapsack gameOn the severity of Braess's paradox: designing networks for selfish users is hardGame-theoretic analysis of Internet switching with selfish usersInefficiency of equilibria for the machine covering game on uniform machinesEquilibria for networks with malicious usersTradeoffs in worst-case equilibriaPrice of anarchy in parallel processingScheduling to Maximize ParticipationA Coordination Mechanism for a Scheduling Game with Uniform-Batching MachinesThe price of anarchy is independent of the network topologyNonadaptive Selfish Routing with Online DemandsThe price of optimum in Stackelberg games on arbitrary single commodity networks and latency functionsThe Influence of Link Restrictions on (Random) Selfish RoutingSubjective vs. Objective Reality — The Risk of Running LateStrong price of anarchyCoordination mechanisms for selfish schedulingEfficient graph topologies in network routing gamesHow hard is it to find extreme Nash equilibria in network congestion games?Structure and complexity of extreme Nash equilibriaSelfish unsplittable flows




This page was built for publication: