The following pages link to Algorithmic Game Theory (Q5432685):
Displaying 50 items.
- Swarm intelligence for self-organized clustering (Q86925) (← links)
- How to allocate goods in an online market? (Q262246) (← links)
- A sequential procurement model for a PPP project pipeline (Q280172) (← links)
- Graphical potential games (Q281410) (← links)
- Computing approximate Nash equilibria in general network revenue management games (Q296621) (← links)
- The Subset Sum game (Q296979) (← links)
- An application of optimization theory to the study of equilibria for games: a survey (Q301040) (← links)
- Traffic routing oligopoly (Q302120) (← links)
- Synthesis with rational environments (Q314471) (← links)
- PQ oligopoly, proportional rationing, and randomly ordered consumers (Q314620) (← links)
- Non-cooperative capacitated facility location games (Q318924) (← links)
- Customer equilibrium and optimal strategies in an M/M/1 queue with dynamic service control (Q322922) (← links)
- Local matching of flexible load in smart grids (Q323256) (← links)
- Pricing combinatorial auctions by a set of linear price vectors (Q331786) (← links)
- Generalized mirror descents in congestion games (Q334813) (← links)
- Convergence to equilibrium of logit dynamics for strategic games (Q334931) (← links)
- Strategyproof facility location for concave cost functions (Q334934) (← links)
- Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
- Bio-inspired paradigms in network engineering games (Q351783) (← links)
- Optimal equilibrium bidding strategies for budget constrained bidders in sponsored search auctions (Q373243) (← links)
- Load balancing via random local search in closed and open systems (Q383274) (← links)
- Social context congestion games (Q386894) (← links)
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917) (← links)
- Coping with selfish on-going behaviors (Q418112) (← links)
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← links)
- Pairwise cooperations in selfish ring routing for minimax linear latency (Q443709) (← links)
- On the variational equilibrium as a refinement of the generalized Nash equilibrium (Q445029) (← links)
- Exploiting symmetries for single- and multi-agent partially observable stochastic domains (Q456732) (← links)
- Worst-case equilibria (Q458478) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- A note on proofs of existence of Nash equilibria in finite strategic games, of two players (Q458483) (← links)
- Strategic bidding behaviors in nondecreasing sponsored search auctions (Q460277) (← links)
- Robust and scalable middleware for selfish-computer systems (Q465675) (← links)
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- A game-theoretic analysis of rank-order mechanisms for user-generated content (Q472203) (← links)
- Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game (Q503156) (← links)
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness (Q503458) (← links)
- Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
- Nash equilibria in the two-player kidney exchange game (Q507331) (← links)
- Paradoxes in social networks with multiple products (Q516241) (← links)
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- Combinatorial auctions without money (Q521808) (← links)
- Welfare lower bounds and strategy-proofness in the queueing problem (Q523512) (← links)
- Hanabi is NP-hard, even for cheaters who look at their cards (Q528493) (← links)
- Permutation betting markets: singleton betting with extra information (Q547299) (← links)
- Cooperative games in facility location situations with regional fixed costs (Q628664) (← links)
- Local and global price of anarchy of graphical games (Q631783) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← links)
- Distributed algorithmic mechanism design for scheduling on unrelated machines (Q635328) (← links)
