A better-response strategy for self-interested planning agents

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Applied intelligence (Boston)

• Publication date

  2017-08-15

• Fields of study

  Computer Science, Economics

• Identifiers
  DOI 10.1007/s10489-017-1046-5
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Multi-Parameter Complexity Analysis of Cost-Optimal and Net-Benefit Planning

  2016cited by this paper
• Game-Theoretic Approach for Non-Cooperative Planning

  2015cited by this paper
• Global Heuristics for Distributed Cooperative Multi-Agent Planning

  2015influential reference
• FMAP: Distributed cooperative multi-agent planning

  2014cited by this paper
• Group planning with time constraints

  2013cited by this paper
• A flexible coupling approach to multi-agent planning under incomplete information

  2012cited by this paper
• Scaling Up Multiagent Planning: A Best-Response Approach

  2011influential reference
• The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks

  2010cited by this paper
• Automated Planning in Repeated Adversarial Games

  2010cited by this paper
• Solving coalitional resource games

  2010cited by this paper
• How long to equilibrium? The communication complexity of uncoupled equilibrium procedures

  2010cited by this paper
• Planning Games

  2009cited by this paper
• A Planning Graph Heuristic for Forward-Chaining Adversarial Planning

  2008cited by this paper
• Multiagent Systems: Introduction to Noncooperative Game Theory: Games in Normal Form

  2008influential reference
• Convergence to approximate Nash equilibria in congestion games

  2007cited by this paper
• Algorithmic Game Theory

  2007cited by this paper
• The Fast Downward Planning System

  2006cited by this paper
• Settling the Complexity of Two-Player Nash Equilibrium

  2006cited by this paper
• Theory of Games and Economic Behavior

  2006cited by this paper
• Sink equilibria and convergence

  2005cited by this paper
• Chapter 14 – Temporal Planning

  2004cited by this paper
• Automated Planning: Theory & Practice

  2004cited by this paper
• The complexity of pure Nash equilibria

  2004cited by this paper
• Complexity results for standard benchmark domains in planning

  2003influential reference
• Learning in Games by Random Sampling

  2001cited by this paper
• A Resource Logic for Multi-Agent Plan Merging

  2001cited by this paper
• Computationally feasible VCG mechanisms

  2000cited by this paper
• PDDL-the planning domain definition language

  1998cited by this paper
• REGULAR ARTICLEPotential Games

  1996cited by this paper
• Congestion Games with Player-Specific Payoff Functions

  1996cited by this paper
• The Computational Complexity of Propositional STRIPS Planning

  1994influential reference
• On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence

  1994cited by this paper
• How Easy is Local Search?

  1985cited by this paper
• A class of games possessing pure-strategy Nash equilibria

  1973cited by this paper
• Theory of games and economic behavior

  1945cited by this paper
• Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Incentive Engineering for Boolean Games ∗

  year unknowncited by this paper
• To appear in: Int Journal of Group Decision and Negotiation GDN2000 Keynote Paper Automated Negotiation: Prospects, Methods and Challenges

  year unknowncited by this paper

• Best-response planning for urban fleet coordination

  2023influential citation
• Sustainable Smart Cities and Territories

  2022cites this paper
• Electric vehicle charging stations emplacement using genetic algorithms and agent-based simulation

  2022cites this paper
• Infrastructure for the Enhancement of Urban Fleet Simulation

  2021cites this paper
• Demand-Responsive Shared Transportation: A Self-Interested Proposal

  2021cites this paper
• Planning Against Adversary in Zero-Sum Games: Heuristics for Selecting and Ordering Critical Actions

  2021influential citation
• SMASH: a Semantic-enabled Multi-agent Approach for Self-adaptation of Human-centered IoT

  2021cites this paper
• Towards Generating Effective Plans in Zero-sum Games by Estimating Strategy of an Adversary

  2020cites this paper
• An Abstract Framework for Non-Cooperative Multi-Agent Planning

  2019cites this paper
• Appliance-Level Flexible Scheduling for Socio-Technical Smart Grid Optimization

  2019cites this paper
• Path Planning Games

  2019cites this paper
• Plan merging by reuse for multi-agent planning

  2019cites this paper
• A stochastic approximation method for price-based assignment of Electric Vehicles to Charging Stations

  2019cites this paper
• Using Classical Planning in Adversarial Problems

  2019cites this paper
• HogRider: Champion Agent of Microsoft Malmo Collaborative AI Challenge

  2018cites this paper
• Large scale strategic decision making in multi-agent systems

  2018cites this paper
• Emergence of divisional cooperation with negotiation and re-learning and evaluation of flexibility in continuous cooperative patrol problem

  2018cites this paper