Algorithmic Game Theory

DOI10.1017/CBO9780511800481zbMath1130.91005MaRDI QIDQ5432685

No author found.

Publication date: 18 December 2007

Mathematics Subject Classification ID

00B15: Collections of articles of miscellaneous specific interest

91-06: Proceedings, conferences, collections, etc. pertaining to game theory, economics, and finance

91Axx: Game theory

Related Items

Hats, auctions and derandomization, The Price of Stochastic Anarchy, Bounds on the welfare loss from moral hazard with limited liability, “Beat-Your-Rival” Routing Games, Web Services and Incerta Spiriti: A Game Theoretic Approach to Uncertainty, Network Games with Quantum Strategies, A Simplex-Like Algorithm for Fisher Markets, Nash Equilibria in Fisher Market, Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games, AN EFFICIENT AND INFORMATION THEORETICALLY SECURE RATIONAL SECRET SHARING SCHEME BASED ON SYMMETRIC BIVARIATE POLYNOMIALS, A Unified Framework for Strong Price of Anarchy in Clustering Games, Further Results on Capacitated Network Design Games, Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design, Characterization and Computation of Equilibria for Indivisible Goods, Generalized Hypergraph Matching via Iterated Packing and Local Ratio, Online Allocation and Pricing with Economies of Scale, Rationality Authority for Provable Rational Behavior, On the Complexity of Equilibria Problems in Angel-Daemon Games, Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games, Selection functions, bar recursion and backward induction, When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures, $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games, When Ignorance Helps: Graphical Multicast Cost Sharing Games, From Graph Theory to Models of Economic Networks. A Tutorial, GTES : une méthode de simulation par jeux et apprentissage pour l'analyse des systèmes d'acteurs, Bio-inspired paradigms in network engineering games, Optimal equilibrium bidding strategies for budget constrained bidders in sponsored search auctions, Load balancing via random local search in closed and open systems, Social context congestion games, \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games, Coping with selfish on-going behaviors, Cooperative location games based on the minimum diameter spanning Steiner subgraph problem, Pairwise cooperations in selfish ring routing for minimax linear latency, On the variational equilibrium as a refinement of the generalized Nash equilibrium, Exploiting symmetries for single- and multi-agent partially observable stochastic domains, Worst-case equilibria, Equilibria, fixed points, and complexity classes, Nash equilibria: complexity, symmetries, and approximation, A note on proofs of existence of Nash equilibria in finite strategic games, of two players, Strategic bidding behaviors in nondecreasing sponsored search auctions, Robust and scalable middleware for selfish-computer systems, Selfish splittable flows and NP-completeness, A game-theoretic analysis of rank-order mechanisms for user-generated content, Permutation betting markets: singleton betting with extra information, Cooperative games in facility location situations with regional fixed costs, Local and global price of anarchy of graphical games, On the performance of approximate equilibria in congestion games, Distributed algorithmic mechanism design for scheduling on unrelated machines, A system-theoretic model for cooperation, interaction and allocation, Nash equilibria and the price of anarchy for flows over time, Price of stability in survivable network design, The complexity of game isomorphism, Selfish bin covering, Equilibria problems on games: complexity versus succinctness, Semidefinite programming for min-max problems and games, Design of price mechanisms for network resource allocation via price of anarchy, A complete characterization of group-strategyproof mechanisms of cost-sharing, Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems, Computing optimal contracts in combinatorial agencies, Tractable stochastic analysis in high dimensions via robust optimization, Exact and approximate equilibria for optimal group network formation, Competitive routing over time, Double best response dynamics in topology formation game for ad hoc networks, Decomposition algorithms for generalized potential games, Strong mediated equilibrium, When ignorance helps: graphical multicast cost sharing games, Computing the least-core and nucleolus for threshold cardinality matching games, Truthful learning mechanisms for multi-slot sponsored search auctions with externalities, Mechanisms for scheduling with single-bit private values, Imitation games and computation, The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions, Uncomputability and undecidability in economic theory, Market-based pricing in grids: on strategic manipulation and computational cost, Greedy versus social: resource-competing oscillator network as a model of amoeba-based neurocomputer, Natural games, Dynamics in network interaction games, Parameterized two-player Nash equilibrium, A lower bound of \(1+\varphi \) for truthful scheduling mechanisms, An improved method for test case prioritization by incorporating historical test case data, Destroy to save, Pricing traffic in a spanning network, Improving the price of anarchy for selfish routing via coordination mechanisms, Models of strategic behavior, Two-group knapsack game, Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction, Some anomalies of farsighted strategic behavior, Fair by design: multidimensional envy-free mechanisms, Self-organizing flows in social networks, Incentive compatible mulit-unit combinatorial auctions: a primal dual approach, Probabilistic computability and choice, Competitive economy as a ranking device over networks, Efficient coordination mechanisms for unrelated machine scheduling, Strong equilibria in games with the lexicographical improvement property, On a generalized Cournot oligopolistic competition game, Incentive mechanism for selfish nodes in wireless sensor networks based on evolutionary game, Understanding science through the computational lens, On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method, Optimal mechanism design for the private supply of a public good, The price of imperfect competition for a spanning network, Price competition, free entry, and welfare in congested markets, A Solomonic solution to the problem of assigning a private indivisible good, Computational aspects of uncertainty profiles and angel-daemon games, A robust optimization approach to enhancing reliability in production planning under non-compliance risks, Combinatorial auctions with verification are tractable, Evolution of social networks, Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011, Optimal deterministic auctions with correlated priors, Truthful approximation mechanisms for restricted combinatorial auctions, Equilibrium computation of the Hart and Mas-Colell bargaining model, Efficient and fair routing for mesh networks, Primary User Emulation Attack Game in Cognitive Radio Networks: Queuing Aware Dogfight in Spectrum, Limitations of Deterministic Auction Design for Correlated Bidders, AN OVERVIEW ON GAME THEORY APPLICATIONS TO ENGINEERING, MATCHING WITH COUPLES: A MULTIDISCIPLINARY SURVEY, Self-organizing Flows in Social Networks, Sensitivity of computer support game algorithms of safe ship control, Graph Transduction as a Noncooperative Game, A Semantical Approach to Equilibria and Rationality, Coordination Mechanisms for Selfish Parallel Jobs Scheduling, COST AND COMPLEXITY OF HARNESSING GAMES WITH PAYMENTS, A Survey on Approximation Mechanism Design Without Money for Facility Games, Network Creation Games: Think Global – Act Local, A Numbers-on-Foreheads Game, Inclusive Block Chain Protocols, BOUNDS ON THE CONVERGENCE TIME OF DISTRIBUTED SELFISH BIN PACKING