deletions | additions       diff --git a/layout.md b/layout.md  index 8fa496d..bc483c8 100644  --- a/layout.md  +++ b/layout.md 
...
In_this_paper_we.tex  sectionReducing_Opti.tex  Theorem_maximum_soci.tex  sectionSelfIntereste.tex  Some_algorithms_for_.tex  figures/selfInterested1/selfInterested1.png  sectioniBundle_for_M.tex  diff --git a/sectionSelfIntereste.tex b/sectionSelfIntereste.tex  deleted file mode 100644  index c6eac57..0000000  --- a/sectionSelfIntereste.tex  +++ /dev/null 
...
\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. 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.