The following pages link to Algorithmic Game Theory (Q5432685):
Displayed 50 items.
- Dynamics in network interaction games (Q1938382) (← links)
- Parameterized two-player Nash equilibrium (Q1949741) (← links)
- A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759) (← links)
- An improved method for test case prioritization by incorporating historical test case data (Q1951617) (← links)
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← links)
- Incentive-based search for equilibria in Boolean games (Q2009196) (← links)
- Destroy to save (Q2016245) (← links)
- Pricing traffic in a spanning network (Q2016252) (← links)
- Full surplus extraction from samples (Q2025025) (← links)
- Large-scale group decision-making with non-cooperative behaviors and heterogeneous preferences: an application in financial inclusion (Q2028864) (← links)
- Game theoretic approach for bandwidth sharing in future generation networks (Q2030161) (← links)
- System optimal routing of traffic flows with user constraints using linear programming (Q2030327) (← links)
- A review of transport market modeling using game-theoretic principles (Q2030641) (← links)
- Average-case approximation ratio of scheduling without payments (Q2032343) (← links)
- On the price of anarchy of two-stage machine scheduling games (Q2051911) (← links)
- Non-cooperative queueing games on a network of single server queues (Q2052440) (← links)
- Data clustering via cooperative games: a novel approach and comparative study (Q2054061) (← links)
- Prior-free online mechanisms for queueing with arrivals (Q2059079) (← links)
- Strategyproof mechanisms for friends and enemies games (Q2060745) (← links)
- Social media as author-audience games (Q2066637) (← links)
- A fragile multi-CPR game (Q2074843) (← links)
- A resource-competitive jamming defense (Q2075623) (← links)
- Truthful mechanism design for bin packing with applications on cloud computing (Q2084605) (← links)
- Bounding quality of pure Nash equilibria in dual-role facility location games (Q2091109) (← links)
- Spatial ecology, optimal control and game theoretical fishing problems (Q2093238) (← links)
- Discrete versions of the KKM lemma and their PPAD-completeness (Q2097223) (← links)
- Theoretical design of decentralized auction framework under mobile crowdsourcing environment (Q2098187) (← links)
- Structural control in weighted voting games (Q2098945) (← links)
- No-dimensional Tverberg theorems and algorithms (Q2105318) (← links)
- Augmented probability simulation methods for sequential games (Q2106757) (← links)
- Non-blind strategies in timed network congestion games (Q2112118) (← links)
- Algorithms for flows over time with scheduling costs (Q2118123) (← links)
- Computing Shapley values in the plane (Q2118220) (← links)
- Strategy-proof mechanism for online resource allocation in cloud and edge collaboration (Q2118409) (← links)
- Probabilistic fixed ballot rules and hybrid domains (Q2138383) (← links)
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs (Q2140265) (← links)
- Automatic verification of concurrent stochastic systems (Q2147696) (← links)
- Cubic regularized Newton method for the saddle point models: a global and local convergence analysis (Q2148117) (← links)
- A cooperative game framework for detecting overlapping communities in social networks (Q2148637) (← links)
- On lower iteration complexity bounds for the convex concave saddle point problems (Q2149573) (← links)
- On incentive compatibility in dynamic mechanism design with exit option in a Markovian environment (Q2150676) (← links)
- Two-way greedy: algorithms for imperfect rationality (Q2152097) (← links)
- Beyond Pigouvian taxes: a worst case analysis (Q2152117) (← links)
- A consumer-theoretic characterization of Fisher market equilibria (Q2152128) (← links)
- Approximating Nash social welfare under binary XOS and binary subadditive valuations (Q2152132) (← links)
- Compartmental observability approach for the optimal transparency problem in multi-agent systems (Q2158971) (← links)
- Computing equilibria for integer programming games (Q2160491) (← links)
- Competition games between teams vying for common resources under consensus dynamics on networks (Q2163667) (← links)
- Mechanisms for dual-role-facility location games: truthfulness and approximability (Q2172605) (← links)
- The quality of equilibria for set packing and throughput scheduling games (Q2178650) (← links)