deletions | additions       diff --git a/sectionSelfIntereste.tex b/sectionSelfIntereste.tex  index 83700c7..f4a5c8f 100644  --- a/sectionSelfIntereste.tex  +++ b/sectionSelfIntereste.tex 
...
\section{Self-Interested MAPF}  MAPF algorithms have largely focused on a cooperative setting in which solutions aim at minizing the total cost for all agents. In such settings, agents are willing to incur a higher cost (taking a longer path) to decrease the total cost of all agents. However, there are many settings in which agent may be self-interested, seeking to minimize their own costs without considering other agents' welfare. For example,  Each agent has a goal.   Agents want to reach their goal with minimum cost.