Sıralama problemlerinde kıskançlığı önleyen çözümlerin karakterizasyonu

In this study we are working on queuing problems. In our model a solutionto a queuing problem is an ordering of agents and a transfer vector where thesum of the transfers of agents is equal to zero. Hence a queuing problem is adouble, where we have a finite set of agents and a profile of payoff functions ofagents which represent their preferences on their orderings and transfers. Weare assuming that the payoff functions of agents are quasi-linear on transfers.Our main aim is to find envy free solutions for queuing problems. Since payofffunctions of agents are quasi-linear envy freeness implies Pareto efficiency. Forproblems where there are less than five agents, we show that the set of envyfree solutions is not empty and we are able to characterize the envy freesolutions. We conjecture that our results may be extended to general casesimilar to our extension from three person case to four person case. Whenwe assume that a queuing problem satisfies order preservation property weare able to characterize envy free solutions with a solution concept that weintroduce in this study.Keywords: Queuing Problems, No-envy.