Algorithmic Game Theory

DOI10.1017/CBO9780511800481zbMath1130.91005OpenAlexW2508573783MaRDI QIDQ5432685

No author found.

Publication date: 18 December 2007

Full work available at URL: https://doi.org/10.1017/cbo9780511800481

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to game theory, economics, and finance (91-06) Game theory (91Axx)

Related Items

Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms, Łukasiewicz Games, Algorithms for Flows over Time with Scheduling Costs, Altruistic Hedonic Games, Generalized Nash Equilibrium Problems with Partial Differential Operators: Theory, Algorithms, and Risk Aversion, Some Results about the Contractions and the Pendant Pairs of a Submodular System, Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses, Unnamed Item, Efficient Fair Division with Minimal Sharing, A convergence analysis of the price of anarchy in atomic congestion games, The Value of Information in Selfish Routing, The interaction of economic agents in Cournot duopoly models under ecological conditions: a comparison of organizational modes, Approximate variational inequalities and equilibria, Successive minimum spanning trees, The polyhedral geometry of truthful auctions, Characterization of Vickrey auction with reserve price for multiple objects, Well-behaved online load balancing against strategic jobs, A stochastic variant of replicator dynamics in zero-sum games and its invariant measures, A game-theoretical approach for policing decision support, \textsc{PeerNomination}: a novel peer selection algorithm to handle strategic and noisy assessments, Reasoning about causality in games, Implicit coordination in an $n$-player target selection game, Budget-balanced and strategy-proof auctions for ridesharing, On the impact of player capability on congestion games, Reasoning about Quality and Fuzziness of Strategic Behaviors, Approximate core allocations for edge cover games, Pure strategy solutions of the progressive discrete silent duel with generalized identical quadratic accuracy functions, Whittle's index based sensor scheduling for multiprocess systems under DoS attacks, Walrasian pricing in multi-unit auctions, Max Euwe's Set-Theoretic Observations on the Game of Chess — Introductory Notes, PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES, Technical Change and the Decentralization Penalty, Primal-Dual First-Order Methods for Affinely Constrained Multi-block Saddle Point Problems, Методы решения теоретико-игровых моделей согласования интересов при управлении рыболовством, Unnamed Item, Greater flexibility in mechanism design through altruism, Score-based explanations in data management and machine learning: an answer-set programming approach to counterfactual analysis, Unnamed Item, Unnamed Item, Comparison of methods of organization and management efficiency in dynamic models of Cournot oligopoly, Randomized strategies for robust combinatorial optimization with approximate separation, Mean Field Equilibria for Resource Competition in Spatial Settings, When Fixed Price Meets Priority Auctions: Competing Firms with Different Pricing and Service Rules, Optimal Mechanism Design for Agents with DSL Strategies: The Case of Sybil Attacks in Combinatorial Auctions, Truthful ownership transfer with expert advice, Multiscale Flux-Based Modeling of Biofilm Communities, Unnamed Item, Decentralized K-User Gaussian Multiple Access Channels, Unnamed Item, Unnamed Item, Unnamed Item, Multiagent Mechanism Design Without Money, Unnamed Item, Unnamed Item, Deterministic and Stochastic Wireless Network Games: Equilibrium, Dynamics, and Price of Anarchy, On Price versus Quality, Stochastic Games, Mechanism Design, Spanning-Tree Games., A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints, Congestion games with priority-based scheduling, Unnamed Item, Unnamed Item, Unnamed Item, Graph Stabilization: A Survey, Pure Nash equilibria in a generalization of congestion games allowing resource failures, Bounds on the welfare loss from moral hazard with limited liability, The Price of Stochastic Anarchy, Unnamed Item, Unnamed Item, Risk-Averse Selfish Routing, Rare Nash Equilibria and the Price of Anarchy in Large Static Games, Informational Braess’ Paradox: The Effect of Information on Traffic Congestion, MODERN PRACTICE OF APPLICATION OF MATRIX GAMES, Worst-Case Mechanism Design via Bayesian Analysis, “Beat-Your-Rival” Routing Games, Unnamed Item, Hessian Barrier Algorithms for Linearly Constrained Optimization Problems, Unnamed Item, Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Selfishness Need Not Be Bad, Family of chaotic maps from game theory, The Price of Stability of Weighted Congestion Games, Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing, Hats, auctions and derandomization, The Price of Stability of Weighted Congestion Games, Coordination problems on networks revisited: statics and dynamics, Nash Equilibria in Certain Two-Choice Multi-Player Games Played on the Ladder Graph, Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings, Recent Results on Strategy-Proofness of Random Social Choice Functions, Computing Large Market Equilibria Using Abstractions, Nash Social Welfare Approximation for Strategic Agents, Weighted modularity optimization for crisp and fuzzy community detection in large-scale networks, Some results of Maria Serna on strategic games: complexity of equilibria and models, A sequential procurement model for a PPP project pipeline, Graphical potential games, Social enterprise tree network games, Strong mediated equilibrium, Computing approximate Nash equilibria in general network revenue management games, The Subset Sum game, An application of optimization theory to the study of equilibria for games: a survey, Traffic routing oligopoly, A parallel machine schedule updating game with compensations and clients averse to uncertain loss, A simple and fast algorithm for convex decomposition in relax-and-round mechanisms, The line planning routing game, When ignorance helps: graphical multicast cost sharing games, Synthesis with rational environments, PQ oligopoly, proportional rationing, and randomly ordered consumers, Non-cooperative capacitated facility location games, Customer equilibrium and optimal strategies in an M/M/1 queue with dynamic service control, Local matching of flexible load in smart grids, Pricing combinatorial auctions by a set of linear price vectors, Generalized mirror descents in congestion games, Convergence to equilibrium of logit dynamics for strategic games, Strategyproof facility location for concave cost functions, Setting lower bounds on truthfulness, The query complexity of correlated equilibria, Truthfulness in advertising? Approximation mechanisms for knapsack bidders, Reasoning about equilibria in game-like concurrent systems, 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, Scheduling without payments, A truthful mechanism for value-based scheduling in cloud computing, Repeated budgeted second price ad auction, Social context congestion games, $\mathcal{NP}$-hardness of pure Nash equilibrium in scheduling and network design games, On discrete preferences and coordination, Computing the least-core and nucleolus for threshold cardinality matching games, Truthful learning mechanisms for multi-slot sponsored search auctions with externalities, Coping with selfish on-going behaviors, Cooperative games in facility location situations with regional fixed costs, Fair linking mechanisms for resource allocation with correlated player types, Cooperative location games based on the minimum diameter spanning Steiner subgraph problem, Automated competitive analysis of real-time scheduling with graph games, Winner determination in geometrical combinatorial auctions, Local and global price of anarchy of graphical games, Mechanisms for scheduling with single-bit private values, On the performance of approximate equilibria in congestion games, Distributed algorithmic mechanism design for scheduling on unrelated machines, Pairwise cooperations in selfish ring routing for minimax linear latency, On the variational equilibrium as a refinement of the generalized Nash equilibrium, Capacity allocation games without an initial sequence, Demand-flow of agents with gross-substitute valuations, Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games, A system-theoretic model for cooperation, interaction and allocation, Incentive-based search for efficient equilibria of the public goods game, Nash equilibria and the price of anarchy for flows over time, Price of stability in survivable network design, 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, The complexity of game isomorphism, Selfish bin covering, 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, 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, Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game, Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness, Towards more practical linear programming-based techniques for algorithmic mechanism design, Nash equilibria in the two-player kidney exchange game, Distributed Nash equilibrium seeking in networked graphical games, Paradoxes in social networks with multiple products, Path-disruption games: bribery and a probabilistic model, Combinatorial auctions without money, Welfare lower bounds and strategy-proofness in the queueing problem, Hanabi is NP-hard, even for cheaters who look at their cards, A complete characterization of group-strategyproof mechanisms of cost-sharing, Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems, Permutation betting markets: singleton betting with extra information, Swarm intelligence for self-organized clustering, 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, Imitation games and computation, On the shortest path game, The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions, Counting houses of Pareto optimal matchings in the house allocation problem, Fragility of the commons under prospect-theoretic risk attitudes, Double best response dynamics in topology formation game for ad hoc networks, Decomposition algorithms for generalized potential games, Uncomputability and undecidability in economic theory, Market-based pricing in grids: on strategic manipulation and computational cost, Strategy-proof multi-object mechanism design: ex-post revenue maximization with non-quasilinear preferences, How to allocate goods in an online market?, Approximating the Nash Social Welfare with Indivisible Items, Graph Transduction as a Noncooperative Game, A Semantical Approach to Equilibria and Rationality, A Simplex-Like Algorithm for Fisher Markets, Nash Equilibria in Fisher Market, Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games, Coordination Mechanisms for Selfish Parallel Jobs Scheduling, 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, AN EFFICIENT AND INFORMATION THEORETICALLY SECURE RATIONAL SECRET SHARING SCHEME BASED ON SYMMETRIC BIVARIATE POLYNOMIALS, Efficient coordination mechanisms for unrelated machine scheduling, Strong equilibria in games with the lexicographical improvement property, Generalized Hypergraph Matching via Iterated Packing and Local Ratio, COST AND COMPLEXITY OF HARNESSING GAMES WITH PAYMENTS, Equilibrium computation of the Hart and Mas-Colell bargaining model, Efficient and fair routing for mesh networks, Online Allocation and Pricing with Economies of Scale, Stabilizing Network Bargaining Games by Blocking Players, Rationality Authority for Provable Rational Behavior, Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions, On a generalized Cournot oligopolistic competition game, Submodular Functions: Learnability, Structure, and Optimization, Social interactions and the prophylaxis of SI epidemics on networks, The complexity of computational problems about Nash equilibria in symmetric win-lose games, The shortest connection game, Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem, Quantum game players can have advantage without discord, From model checking to equilibrium checking: reactive modules for rational verification, Belief-invariant and quantum equilibria in games of incomplete information, Linear quadratic network games with dynamic players: stabilization and output convergence to Nash equilibrium, A Survey on Approximation Mechanism Design Without Money for Facility Games, Diffusion auction design, Rethinking formal models of partially observable multiagent decision making, Decentralized online integer programming problems with a coupling cardinality constraint, Pure Nash equilibria in a generalization of congestion games allowing resource failures, When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores, Network Creation Games: Think Global – Act Local, Reverse auctions are different from auctions, A Numbers-on-Foreheads Game, Finite uniform approximation of two-person games defined on a product of staircase-function infinite spaces, Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design, Mechanism design and communication networks, Inclusive Block Chain Protocols, Market exchange models and geometric programming, Additive stabilizers for unstable graphs, The anarchy of scheduling without money, Strategyproof allocation mechanisms with endowments and M-convex distributional constraints, Number of Ties and Undefeated Signs in a Generalized Janken, Optimal mechanisms for selling two items to a single buyer having uniformly distributed valuations, On optimal mechanisms in the two-item single-buyer unit-demand setting, Millionaire: a hint-guided approach for crowdsourcing, Competitive Equilibria for Non-quasilinear Bidders in Combinatorial Auctions, A Model of Partnership Formation with Friction and Multiple Criteria, On the Complexity of Equilibria Problems in Angel-Daemon Games, Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games, Incentive mechanism for selfish nodes in wireless sensor networks based on evolutionary game, Chasing Ghosts: Competing with Stateful Policies, 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, A parametric worst-case approach to fairness in cooperative games with transferable utility, Maximizing coverage while ensuring fairness: a tale of conflicting objectives, Unnamed Item, Computational aspects of uncertainty profiles and angel-daemon games, Smart Contract-Driven Mechanism Design to Mitigate Information Diffusion in Social Networks, A robust optimization approach to enhancing reliability in production planning under non-compliance risks, BOUNDS ON THE CONVERGENCE TIME OF DISTRIBUTED SELFISH BIN PACKING, Fixation and escape times in stochastic game learning, Optimizing spread dynamics on graphs by message passing, Selection functions, bar recursion and backward induction, Web Services and Incerta Spiriti: A Game Theoretic Approach to Uncertainty, 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, Equilibria in Online Games, Network Games with Quantum Strategies, 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, A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives, Clairvoyant Mechanisms for Online Auctions, New Results for Network Pollution Games, The Anarchy of Scheduling Without Money, GTES : une méthode de simulation par jeux et apprentissage pour l'analyse des systèmes d'acteurs, 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, Probabilistic computability and choice, Self-organizing Flows in Social Networks, Competitive economy as a ranking device over networks, Sensitivity of computer support game algorithms of safe ship control, Probabilistic fixed ballot rules and hybrid domains, Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs, Automatic verification of concurrent stochastic systems, Cubic regularized Newton method for the saddle point models: a global and local convergence analysis, A cooperative game framework for detecting overlapping communities in social networks, On lower iteration complexity bounds for the convex concave saddle point problems, On incentive compatibility in dynamic mechanism design with exit option in a Markovian environment, Two-way greedy: algorithms for imperfect rationality, Beyond Pigouvian taxes: a worst case analysis, A consumer-theoretic characterization of Fisher market equilibria, Approximating Nash social welfare under binary XOS and binary subadditive valuations, Compartmental observability approach for the optimal transparency problem in multi-agent systems, Computing equilibria for integer programming games, Competition games between teams vying for common resources under consensus dynamics on networks, Mechanisms for dual-role-facility location games: truthfulness and approximability, The quality of equilibria for set packing and throughput scheduling games, Natural games, On the termination of dynamics in sequential games, Multi-round cooperative search games with multiple players, Infinite-duration poorman-bidding games, Optimal pricing for MHR distributions, Equilibria in routing games with edge priorities, Dynamics in network interaction games, Energy allocation and payment: a game-theoretic approach, Smart routing of electric vehicles for load balancing in smart grids, 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, Simultaneous auctions without complements are (almost) efficient, Equilibria and efficiency loss in games on networks, Strategyproof auction mechanisms for network procurement, Equilibria in multi-player multi-outcome infinite sequential games, Reductions in \textbf{PPP}, Non-atomic one-round walks in congestion games, The impact of worst-case deviations in non-atomic network routing games, Computation and efficiency of potential function minimizers of combinatorial congestion games, Committing to correlated strategies with multiple leaders, Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs, Strategic behavior and social optimization in a constant retrial queue with the $N$-policy, Price of fairness for allocating a bounded resource, The complexity of computing a (quasi-)perfect equilibrium for an $n$-player extensive form game, Generic negotiation mechanisms with side payments -- design, analysis and application for decentralized resource-constrained multi-project scheduling problems, Improving the price of anarchy for selfish routing via coordination mechanisms, Dominant-set clustering: a review, The noncooperative transportation problem and linear generalized Nash games, A game-theoretic analysis of transmission-distribution system operator coordination, Network pollution games, Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games, Greedy versus social: resource-competing oscillator network as a model of amoeba-based neurocomputer, Incentive-based search for equilibria in Boolean games, Models of strategic behavior, Destroy to save, Pricing traffic in a spanning network, Two-group knapsack game, Full surplus extraction from samples, How egalitarian are Nash equilibria in network cost-sharing games?, Large-scale group decision-making with non-cooperative behaviors and heterogeneous preferences: an application in financial inclusion, Game theoretic approach for bandwidth sharing in future generation networks, System optimal routing of traffic flows with user constraints using linear programming, A review of transport market modeling using game-theoretic principles, Multistage interval scheduling games, Average-case approximation ratio of scheduling without payments, A distributed algorithm to obtain repeated games equilibria with discounting, Dynamic resource allocation games, Discrete-time linear-quadratic mean-field-type repeated games: perfect, incomplete, and imperfect information, Typology of networks and equilibria in a network game with production and knowledge externalities, Stabilizing network bargaining games by blocking players, Solving equilibrium problems using extended mathematical programming, Cache me if you can: capacitated selfish replication games in networks, On the price of anarchy of two-stage machine scheduling games, Non-cooperative queueing games on a network of single server queues, Data clustering via cooperative games: a novel approach and comparative study, Prior-free online mechanisms for queueing with arrivals, Strategyproof mechanisms for friends and enemies games, Social media as author-audience games, On social envy-freeness in multi-unit markets, Cooperative games with overlapping coalitions: charting the tractability frontier, A fragile multi-CPR game, A resource-competitive jamming defense, On the efficiency of local electricity markets under decentralized and centralized designs: a multi-leader Stackelberg game analysis, Truthful mechanism design for bin packing with applications on cloud computing, A discrete model of market interaction in the presence of social networks and price discrimination, Bounding quality of pure Nash equilibria in dual-role facility location games, Fair optimization and networks: a survey, Spatial ecology, optimal control and game theoretical fishing problems, Discrete versions of the KKM lemma and their PPAD-completeness, Theoretical design of decentralized auction framework under mobile crowdsourcing environment, Structural control in weighted voting games, 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, No-dimensional Tverberg theorems and algorithms, Augmented probability simulation methods for sequential games, A unifying approximate potential for weighted congestion games, Non-blind strategies in timed network congestion games, Algorithms for flows over time with scheduling costs, Computing Shapley values in the plane, Strategy-proof mechanism for online resource allocation in cloud and edge collaboration