Algorithmic Game Theory
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The complexity of computational problems about Nash equilibria in symmetric win-lose games
- Mechanisms for dual-role-facility location games: truthfulness and approximability
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
- Optimal pricing for MHR distributions
- Some results of Maria Serna on strategic games: complexity of equilibria and models
- Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011
- A system-theoretic model for cooperation, interaction and allocation
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
- 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
- A review of transport market modeling using game-theoretic principles
- Optimizing spread dynamics on graphs by message passing
- Truthful learning mechanisms for multi-slot sponsored search auctions with externalities
- scientific article; zbMATH DE number 7561655 (Why is no real title available?)
- Mean field equilibria for resource competition in spatial settings
- Nash equilibria of two-player matrix games repeated until collision
- On the price of anarchy of two-stage machine scheduling games
- Theoretical design of decentralized auction framework under mobile crowdsourcing environment
- Nash equilibria in traffic networks with multiple populations and origins-destinations
- Computing large market equilibria using abstractions
- Network games with quantum strategies
- A practical multi-objective auction design and optimization framework for sponsored search
- Dynamic resource allocation networks in marketing: comparing the effectiveness of control methods
- Discrete and Bayesian transaction fee mechanisms
- Load balancing via random local search in closed and open systems
- Understanding science through the computational lens
- To infinity and beyond: a general framework for scaling economic theories
- Adversarial risk analysis: an overview
- How to allocate goods in an online market?
- Efficient and effective budget-feasible mechanisms for submodular valuations
- When ignorance helps: graphical multicast cost sharing games
- Approximating the Nash Social Welfare with Indivisible Items
- No-dimensional Tverberg theorems and algorithms
- Augmented probability simulation methods for sequential games
- scientific article; zbMATH DE number 7650127 (Why is no real title available?)
- Position auctions for sponsored search in marketplaces
- Social interactions and the prophylaxis of SI epidemics on networks
- Strategyproof auction mechanisms for network procurement
- Solving equilibrium problems using extended mathematical programming
- The anarchy of scheduling without money
- Destroy to save
- Pareto efficiency and approximate Pareto efficiency in routing and load balancing games
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
- Equilibria in multi-player multi-outcome infinite sequential games
- Coordination problems on networks revisited: statics and dynamics
- scientific article; zbMATH DE number 7651150 (Why is no real title available?)
- Decentralized K-User Gaussian Multiple Access Channels
- The query complexity of correlated equilibria
- On the correlation gap of matroids
- The polyhedral geometry of truthful auctions
- scientific article; zbMATH DE number 7561639 (Why is no real title available?)
- A game-theoretical approach for policing decision support
- Reductions in \textbf{PPP}
- The impact of worst-case deviations in non-atomic network routing games
- Games with trading of control
- Łukasiewicz games: a logic-based approach to quantitative strategic interactions
- Dominant-set clustering: a review
- Locating two facilities on a square with a minimum distance requirement
- Non-blind strategies in timed network congestion games
- Game dynamics and equilibrium computation in the population protocol model
- Self-organizing flows in social networks
- Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions
- A discrete model of market interaction in the presence of social networks and price discrimination
- Permutation betting markets: singleton betting with extra information
- On optimal mechanisms in the two-item single-buyer unit-demand setting
- Characterization and computation of equilibria for indivisible goods
- Facility location and restoration games
- A numbers-on-foreheads game
- Some anomalies of farsighted strategic behavior
- The polyhedral geometry of truthful auctions
- Multiscale flux-based modeling of biofilm communities
- Algorithmic Game Theory: A Snapshot
- Truthful approximation mechanisms for restricted combinatorial auctions
- Tractable stochastic analysis in high dimensions via robust optimization
- Risk-averse selfish routing
- Fairness in repetitive scheduling
- Nash equilibria: complexity, symmetries, and approximation
- 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
- Two-timescale gradient descent ascent algorithms for nonconvex minimax optimization
- System optimal routing of traffic flows with user constraints using linear programming
- Existence, computation and efficiency of Nash stable outcomes in hedonic skill games
- Limitations of deterministic auction design for correlated bidders
- A sequential procurement model for a PPP project pipeline
- Graphical potential games
- scientific article; zbMATH DE number 7327943 (Why is no real title available?)
- scientific article; zbMATH DE number 7649928 (Why is no real title available?)
- scientific article; zbMATH DE number 7204414 (Why is no real title available?)
- Locating two facilities on a square with a minimum distance requirement
- Linear quadratic network games with dynamic players: stabilization and output convergence to Nash equilibrium
- Convergence to equilibrium of logit dynamics for strategic games
- A self-contained karma economy for the dynamic allocation of common resources
- Social enterprise tree network games
- On the optimal mixing problem of approximate Nash equilibria in bimatrix games
- Discrete versions of the KKM lemma and their PPAD-completeness
- On complete classes of valuated matroids
- Successive minimum spanning trees
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- How much data is sufficient to learn high-performing algorithms?
This page was built for publication: Algorithmic Game Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432685)
