Algorithms, games, and the internet
From MaRDI portal
Publication:5176034
DOI10.1145/380752.380883zbMath1323.68022OpenAlexW2125537511WikidataQ61920284 ScholiaQ61920284MaRDI QIDQ5176034
Publication date: 27 February 2015
Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/380752.380883
Games involving graphs (91A43) Auctions, bargaining, bidding and selling, and other market models (91B26) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Internet topics (68M11)
Related Items
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 ⋮ Cost-Sharing Scheduling Games on Restricted Unrelated Machines ⋮ Unnamed Item ⋮ The Price of Matching with Metric Preferences ⋮ Dynamics in tree formation games ⋮ Minimality of a solution update in conflict resolution: An application of revision programming to the von Neumann-Morgenstern approach ⋮ The Exact Computational Complexity of Evolutionarily Stable Strategies ⋮ Anarchy Is Free in Network Creation ⋮ Sharing Non-anonymous Costs of Multiple Resources Optimally ⋮ The interaction of economic agents in Cournot duopoly models under ecological conditions: a comparison of organizational modes ⋮ How bad is the merger paradox? ⋮ The price of anarchy for utilitarian scheduling games on related machines ⋮ Cost-sharing games with rank-based utilities ⋮ How bad is the merger paradox? ⋮ An Incentive Mechanism for Selfish Bin Covering ⋮ Geometric Network Creation Games ⋮ Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost ⋮ Robust networked multiagent optimization: designing agents to repair their own utility functions ⋮ Scheduling games with rank-based utilities ⋮ Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games ⋮ Using Temporal Dummy Players in Cost-Sharing Games ⋮ Comparison of methods of organization and management efficiency in dynamic models of Cournot oligopoly ⋮ On equilibria for ADM minimization games ⋮ Unnamed Item ⋮ The price of anarchy in routing games as a function of the demand ⋮ Efficiency analysis of load balancing games with and without activation costs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ When is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic ⋮ Approximate strong equilibria in job scheduling games with two uniformly related machines ⋮ Prices of Anarchy of Selfish 2D Bin Packing Games ⋮ Selfish Bin Packing ⋮ Capacity allocation to sales agents in a decentralized logistics network ⋮ Appraising two decades of distributed computing theory research ⋮ Batch queues with choice of arrivals: equilibrium analysis and experimental study ⋮ The price of anarchy in an exponential multi-server ⋮ Complexity of constructing solutions in the core based on synergies among coalitions ⋮ Hierarchical Network Formation Games ⋮ Approximate Strong Equilibrium in Job Scheduling Games ⋮ Selfish routing with incomplete information ⋮ Unnamed Item ⋮ Mixed Nash equilibria in selfish routing problems with dynamic constraints ⋮ Equilibria of Greedy Combinatorial Auctions ⋮ On certain connectivity properties of the internet topology ⋮ Geometrie und Kombinatorik von Nash-Gleichgewichten. ⋮ Robust game theory ⋮ How much can taxes help selfish routing? ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Unnamed Item ⋮ Tradeoffs in worst-case equilibria ⋮ Scheduling to Maximize Participation ⋮ The price of anarchy is independent of the network topology ⋮ Fault-Tolerant Aggregate Signatures ⋮ Load rebalancing games in dynamic systems with migration costs ⋮ Computing Nash equilibria for scheduling on restricted parallel links ⋮ A Stackelberg strategy for routing flow over time ⋮ Approximate Equilibria for Strategic Two Person Games ⋮ The Price of Anarchy on Uniformly Related Machines Revisited ⋮ Window-Games between TCP Flows ⋮ Frugal Routing on Wireless Ad-Hoc Networks ⋮ A geometric approach to the price of anarchy in nonatomic congestion games ⋮ Truthful approximation mechanisms for restricted combinatorial auctions ⋮ Unnamed Item ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ Risk-Averse Selfish Routing ⋮ Location Games on Networks: Existence and Efficiency of Equilibria ⋮ Generating Random Networks Without Short Cycles ⋮ Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions ⋮ On the Price of Anarchy of Highly Congested Nonatomic Network Games ⋮ Bounded budget connection (BBC) games or how to make friends and influence people, on a budget ⋮ On Network Formation Games with Heterogeneous Players and Basic Network Creation Games ⋮ Pricing in Information Orchestrators and Maximizing Stable Networks ⋮ A mathematical model for the TCP tragedy of the commons ⋮ On the approximability of the range assignment problem on radio networks in presence of selfish agents ⋮ Structure and complexity of extreme Nash equilibria ⋮ Braess's paradox in expanders ⋮ A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times ⋮ Bounding the inefficiency of equilibria in nonatomic congestion games ⋮ Strong equilibrium in cost sharing connection games ⋮ On the complexity of price equilibria ⋮ Coordination mechanisms ⋮ Atomic routing games on maximum congestion ⋮ Computation of equilibria and the price of anarchy in bottleneck congestion games ⋮ A parallel machine schedule updating game with compensations and clients averse to uncertain loss ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ Cost-sharing scheduling games on restricted unrelated machines ⋮ Games of fixed rank: a hierarchy of bimatrix games ⋮ Strategic decentralization in binary choice composite congestion games ⋮ AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents ⋮ Efficiency analysis with respect to the unit cost objectives in scheduling games ⋮ A traffic congestion analysis by user equilibrium and system optimum with incomplete information ⋮ Network-formation games with regular objectives ⋮ Improved lower bounds on the price of stability of undirected network design games ⋮ The price of anarchy for polynomial social cost ⋮ Sharing the cost of multicast transmissions in wireless networks ⋮ Nonpreemptive coordination mechanisms for identical machines ⋮ Efficiency and complexity of price competition among single-product vendors ⋮ Fall back equilibrium for \(2 \times n\) bimatrix games ⋮ Stability, efficiency, and contentedness of social storage networks ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy ⋮ A two-player competitive discrete location model with simultaneous decisions ⋮ Implementation of optimal schedules in outsourcing with identical suppliers ⋮ Buyer-supplier games: optimization over the core ⋮ Transportation network with externalities ⋮ The price of anarchy on uniformly related machines revisited ⋮ The power of one evil secret agent ⋮ Optimal resource allocation in the difference and differential Stackelberg games on marketing networks ⋮ Learning efficient Nash equilibria in distributed systems ⋮ Capacitated network design games ⋮ Convergence to approximate Nash equilibria in congestion games ⋮ The strong price of anarchy of linear bottleneck congestion games ⋮ On the performance of approximate equilibria in congestion games ⋮ Parameterized two-player Nash equilibrium ⋮ On network formation games with heterogeneous players and basic network creation games ⋮ Topological implications of selfish neighbor selection in unstructured peer-to-peer networks ⋮ Convergence and approximation in potential games ⋮ Pairwise cooperations in selfish ring routing for minimax linear latency ⋮ Repeated congestion games with bounded rationality ⋮ Congestion games with failures ⋮ Mean-field type games between two players driven by backward stochastic differential equations ⋮ Tight bounds for selfish and greedy load balancing ⋮ Recent development in computational complexity characterization of Nash equilibrium ⋮ Worst-case equilibria ⋮ Some results of Christos Papadimitriou on internet structure, network routing, and web information ⋮ The complexity of game isomorphism ⋮ Selfish splittable flows and NP-completeness ⋮ Bounded budget betweenness centrality game for strategic network formations ⋮ Equilibria problems on games: complexity versus succinctness ⋮ Bounding the payment of approximate truthful mechanisms ⋮ Convergence of best-response dynamics in games with conflicting congestion effects ⋮ New complexity results about Nash equilibria ⋮ Simple search methods for finding a Nash equilibrium ⋮ Scheduling to maximize participation ⋮ Price of anarchy for highly congested routing games in parallel networks ⋮ Cost sharing mechanisms for fair pricing of resource usage ⋮ Price of anarchy for graph coloring games with concave payoff ⋮ Strategic sharing of a costly network ⋮ On the tree conjecture for the network creation game ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ The price of optimum: complexity and approximation for a matching game ⋮ 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 ⋮ How to find Nash equilibria with extreme total latency in network congestion games? ⋮ Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS ⋮ Well supported approximate equilibria in bimatrix games ⋮ Bounding the inefficiency of the C-logit stochastic user equilibrium assignment ⋮ Window-games between TCP flows ⋮ Bayesian ignorance ⋮ Computing optimal contracts in combinatorial agencies ⋮ Imitation games and computation ⋮ Dynamic resource allocation games ⋮ Network design with weighted players ⋮ SPICE-models with independent agents ⋮ The power of verification for one-parameter agents ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ Strong price of anarchy ⋮ Choice of routes in congested traffic networks: Experimental tests of the Braess paradox ⋮ Strongly polynomial-time truthful mechanisms in one shot ⋮ Efficient graph topologies in network routing games ⋮ Efficiency of atomic splittable selfish routing with polynomial cost functions ⋮ How hard is it to find extreme Nash equilibria in network congestion games? ⋮ Bounding the inefficiency of logit-based stochastic user equilibrium ⋮ Strategic network formation through an intermediary ⋮ On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games ⋮ Sustainability of intertwined supply networks: a game-theoretic approach ⋮ Price of fairness on networked auctions ⋮ Scheduling games on uniform machines with activation cost ⋮ Enforcing efficient equilibria in network design games via subsidies ⋮ Incentive compatible mulit-unit combinatorial auctions: a primal dual approach ⋮ Allocating multiple defensive resources in a zero-sum game setting ⋮ A unifying approximate potential for weighted congestion games ⋮ Timed network games ⋮ Combinatorial structure and randomized subexponential algorithms for infinite games
Cites Work
