We propose a framework for argumentation-basednegotiation where Agents' constraints such as budget and time play a key role in determining the set of offers agents can make. Each offer is supported by arguments and each agent tries to achieve an agreement using arguments to persuade the opponent to make concession. An agreement is achieved when the last offer is accepted. Two concession and two acceptance strategies are identified and their different combinations result in four types of negotiating agents. The paper discusses completeness, Pareto optimality, and Nash equilibrium results with respect to these types.