Algorithmic Game Theory
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- Uncomputability and undecidability in economic theory
- Market-based pricing in grids: on strategic manipulation and computational cost
- Weighted modularity optimization for crisp and fuzzy community detection in large-scale networks
- Social enterprise tree network games
- 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
- Setting lower bounds on truthfulness
- The query complexity of correlated equilibria
- Truthfulness in advertising? Approximation mechanisms for knapsack bidders
- Scheduling without payments
- A truthful mechanism for value-based scheduling in cloud computing
- Repeated budgeted second price ad auction
- On discrete preferences and coordination
- Fair linking mechanisms for resource allocation with correlated player types
- Automated competitive analysis of real-time scheduling with graph games
- Winner determination in geometrical combinatorial auctions
- 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
- Incentive-based search for efficient equilibria of the public goods game
- Reductions in \textbf{PPP}
- Non-atomic one-round walks in congestion games
- The impact of worst-case deviations in non-atomic network routing games
- 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
- Generic negotiation mechanisms with side payments -- design, analysis and application for decentralized resource-constrained multi-project scheduling problems
- 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
- How egalitarian are Nash equilibria in network cost-sharing games?
- Stabilizing network bargaining games by blocking players
- Natural games
- Dynamics in network interaction games
- A lower bound of \(1+\varphi \) for truthful scheduling mechanisms
- An improved method for test case prioritization by incorporating historical test case data
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
- Incentive-based search for equilibria in Boolean games
- Destroy to save
- Pricing traffic in a spanning network
- Full surplus extraction from samples
- 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
- Average-case approximation ratio of scheduling without payments
- 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
- A fragile multi-CPR game
- A resource-competitive jamming defense
- Truthful mechanism design for bin packing with applications on cloud computing
- Bounding quality of pure Nash equilibria in dual-role facility location games
- 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
- No-dimensional Tverberg theorems and algorithms
- Augmented probability simulation methods for sequential 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
- 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
- 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
- Energy allocation and payment: a game-theoretic approach
- Smart routing of electric vehicles for load balancing in smart grids
- 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
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- Committing to correlated strategies with multiple leaders
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)
