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 (only showing first 100 items - show all)

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?

This page was built for publication: Algorithmic Game Theory