The following pages link to Algorithmic Game Theory (Q5432685):
Displaying 50 items.
- A system-theoretic model for cooperation, interaction and allocation (Q643011) (← links)
- Nash equilibria and the price of anarchy for flows over time (Q647485) (← links)
- Price of stability in survivable network design (Q647493) (← links)
- The complexity of game isomorphism (Q650900) (← links)
- Selfish bin covering (Q650947) (← links)
- Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
- Semidefinite programming for min-max problems and games (Q662286) (← links)
- Design of price mechanisms for network resource allocation via price of anarchy (Q662298) (← links)
- Distributed Nash equilibrium seeking in networked graphical games (Q680484) (← links)
- A complete characterization of group-strategyproof mechanisms of cost-sharing (Q692628) (← links)
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems (Q695344) (← links)
- Computing optimal contracts in combinatorial agencies (Q714788) (← links)
- Tractable stochastic analysis in high dimensions via robust optimization (Q715242) (← links)
- Exact and approximate equilibria for optimal group network formation (Q719269) (← links)
- Competitive routing over time (Q719282) (← links)
- On the shortest path game (Q729795) (← links)
- Counting houses of Pareto optimal matchings in the house allocation problem (Q738845) (← links)
- Fragility of the commons under prospect-theoretic risk attitudes (Q738933) (← links)
- Double best response dynamics in topology formation game for ad hoc networks (Q747338) (← links)
- Decomposition algorithms for generalized potential games (Q763403) (← links)
- Strategy-proof multi-object mechanism design: ex-post revenue maximization with non-quasilinear preferences (Q785519) (← links)
- Some results of Maria Serna on strategic games: complexity of equilibria and models (Q826318) (← links)
- Strong mediated equilibrium (Q834404) (← links)
- When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
- Computing the least-core and nucleolus for threshold cardinality matching games (Q897924) (← links)
- Truthful learning mechanisms for multi-slot sponsored search auctions with externalities (Q899160) (← links)
- Mechanisms for scheduling with single-bit private values (Q904689) (← links)
- Imitation games and computation (Q993779) (← links)
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
- Uncomputability and undecidability in economic theory (Q1036534) (← links)
- Market-based pricing in grids: on strategic manipulation and computational cost (Q1046122) (← links)
- Weighted modularity optimization for crisp and fuzzy community detection in large-scale networks (Q1619889) (← links)
- Social enterprise tree network games (Q1622035) (← links)
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
- A simple and fast algorithm for convex decomposition in relax-and-round mechanisms (Q1634087) (← links)
- The line planning routing game (Q1634301) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- The query complexity of correlated equilibria (Q1651292) (← links)
- Truthfulness in advertising? Approximation mechanisms for knapsack bidders (Q1651735) (← links)
- Scheduling without payments (Q1678760) (← links)
- A truthful mechanism for value-based scheduling in cloud computing (Q1678764) (← links)
- Repeated budgeted second price ad auction (Q1678769) (← links)
- On discrete preferences and coordination (Q1686225) (← links)
- Fair linking mechanisms for resource allocation with correlated player types (Q1698330) (← links)
- Automated competitive analysis of real-time scheduling with graph games (Q1698779) (← links)
- Winner determination in geometrical combinatorial auctions (Q1698906) (← links)
- Capacity allocation games without an initial sequence (Q1709948) (← links)
- Demand-flow of agents with gross-substitute valuations (Q1709953) (← links)
- Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games (Q1709974) (← links)
- Incentive-based search for efficient equilibria of the public goods game (Q1711883) (← links)
