The following pages link to Algorithmic Game Theory (Q2819442):
Displaying 50 items.
- Approximate well-supported Nash equilibria below two-thirds (Q329276) (← links)
- Mixing time and stationary expected social welfare of logit dynamics (Q372983) (← links)
- On the structure of weakly acyclic games (Q372989) (← links)
- Braess's paradox for flows over time (Q372993) (← links)
- When can limited randomness be used in repeated games? (Q506541) (← links)
- Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games (Q524372) (← links)
- Imperfect best-response mechanisms (Q904687) (← links)
- Network bargaining: using approximate blocking sets to stabilize unstable instances (Q904691) (← links)
- An almost ideal coordination mechanism for unrelated machine scheduling (Q1733383) (← links)
- On the communication complexity of approximate Nash equilibria (Q2442839) (← links)
- Logarithmic Query Complexity for Approximate Nash Computation in Large Games (Q2819443) (← links)
- Lipschitz Continuity and Approximate Equilibria (Q2819444) (← links)
- The Parallel Complexity of Coloring Games (Q2819445) (← links)
- Complexity and Optimality of the Best Response Algorithm in Random Potential Games (Q2819446) (← links)
- Deciding Maxmin Reachability in Half-Blind Stochastic Games (Q2819447) (← links)
- The Big Match in Small Space (Q2819448) (← links)
- History-Independent Distributed Multi-agent Learning (Q2819449) (← links)
- On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games (Q2819450) (← links)
- Efficiency of Equilibria in Uniform Matroid Congestion Games (Q2819451) (← links)
- On the Price of Anarchy of Highly Congested Nonatomic Network Games (Q2819452) (← links)
- The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games (Q2819453) (← links)
- On Selfish Creation of Robust Networks (Q2819455) (← links)
- Dynamic Resource Allocation Games (Q2819456) (← links)
- Analyzing Power in Weighted Voting Games with Super-Increasing Weights (Q2819457) (← links)
- Strong and Weak Acyclicity in Iterative Voting (Q2819458) (← links)
- Stable Matching with Uncertain Linear Preferences (Q2819459) (← links)
- The Stable Roommates Problem with Short Lists (Q2819460) (← links)
- The Price of Stability of Simple Symmetric Fractional Hedonic Games (Q2819461) (← links)
- Truthfulness and Approximation with Value-Maximizing Bidders (Q2819462) (← links)
- Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets (Q2819463) (← links)
- SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism (Q2819464) (← links)
- Revenue Maximization for Market Intermediation with Correlated Priors (Q2819465) (← links)
- Bribeproof Mechanisms for Two-Values Domains (Q2819466) (← links)
- The Anarchy of Scheduling Without Money (Q2819467) (← links)
- Designing Cost-Sharing Methods for Bayesian Games (Q2819469) (← links)
- The Complexity of Fully Proportional Representation for Single-Crossing Electorates (Q2856127) (← links)
- New Results on Equilibria in Strategic Candidacy (Q2856128) (← links)
- Plurality Voting with Truth-Biased Agents (Q2856129) (← links)
- Reliability Weighted Voting Games (Q2856130) (← links)
- The Power of Mediation in an Extended El Farol Game (Q2856131) (← links)
- Friend of My Friend: Network Formation with Two-Hop Benefit (Q2856132) (← links)
- Load Rebalancing Games in Dynamic Systems with Migration Costs (Q2856133) (← links)
- Stochastic Congestion Games with Risk-Averse Players (Q2856134) (← links)
- Congestion Games with Player-Specific Costs Revisited (Q2856135) (← links)
- Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information (Q2856136) (← links)
- Anti-coordination Games and Stable Graph Colorings (Q2856137) (← links)
- Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree (Q2856138) (← links)
- Cooperative Equilibria in Iterated Social Dilemmas (Q2856139) (← links)
- Symmetries of Quasi-Values (Q2856140) (← links)
- Dividing Connected Chores Fairly (Q2856141) (← links)
