Algorithmic Game Theory
From MaRDI portal
Publication:5432685
DOI10.1017/CBO9780511800481zbMath1130.91005MaRDI QIDQ5432685
No author found.
Publication date: 18 December 2007
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
The Price of Stochastic Anarchy, 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, 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, Decomposition algorithms for generalized potential games, Strong mediated equilibrium, When ignorance helps: graphical multicast cost sharing games, 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, Two-group knapsack game, Incentive mechanism for selfish nodes in wireless sensor networks based on evolutionary game, Truthful approximation mechanisms for restricted combinatorial auctions, Efficient and fair routing for mesh networks, 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, BOUNDS ON THE CONVERGENCE TIME OF DISTRIBUTED SELFISH BIN PACKING, 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, 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
