Computing the optimal strategy to commit to

@inproceedings{Conitzer2006ComputingTO,
  title={Computing the optimal strategy to commit to},
  author={Vincent Conitzer and T. Sandholm},
  booktitle={EC '06},
  year={2006}
}
  • Vincent Conitzer, T. Sandholm
  • Published in EC '06 2006
  • Economics, Computer Science
  • In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realistic. In many settings, one player is able to commit to a strategy before the other player makes a decision. Such models are synonymously referred to as leadership, commitment, or Stackelberg models, and optimal play in such models is often significantly different from optimal play in the model where strategies are… CONTINUE READING
    415 Citations

    Topics from this paper

    Commitment to Correlated Strategies
    • 47
    • PDF
    Optimal Machine Strategies to Commit to in Two-Person Repeated Games
    • 10
    • PDF
    On the value of commitment
    • 9
    • PDF
    Computational Aspects of Stackelberg Games
    • 5
    • Highly Influenced
    Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
    • 435
    • Highly Influenced
    • PDF
    Learning and Approximating the Optimal Strategy to Commit To
    • 85
    • PDF
    Robust Solutions in Stackelberg Games : Addressing Boundedly Rational Human Preference Models
    • 4
    • Highly Influenced
    • PDF
    Team-Maxmin Equilibrium: Efficiency Bounds and Algorithms
    • 13
    • PDF

    References

    SHOWING 1-3 OF 3 REFERENCES
    Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms
    • 185
    • Highly Influential
    • PDF
    Marktform und Gleichgewicht
    • 811
    • Highly Influential
    Reducibility Among Combinatorial Problems
    • R. Karp
    • Computer Science
    • Complexity of Computer Computations
    • 1972
    • 4,093
    • Highly Influential