deletions | additions       diff --git a/sectionSelfIntereste.tex b/sectionSelfIntereste.tex  index 846242c..c6eac57 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 (i.e., take 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, if rovers of different research organizations are operating on mars, they might want to traverse a path that is optimal for them and not consider other rovers. Such self-interested Self-interested  behavior by agents can lead to suboptimal outcomes and reduced social welfare~\cite{bnaya2013multi}.  %Each agent has a goal.   %Agents want to reach their goal with minimum cost.