Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Va...
Auctions are proposed as a distributed negotiation mean, particularly useful in multiagent systems where both cooperative and self-interested agents compete for resources and serv...
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
The paradigm of mobile agents reached its popularity and attraction from typical application scenarios, which are located in the area of electronic commerce. In these common appli...
Hartmut Vogler, Axel Spriestersbach, Marie-Luise M...
Available resources can often be limited with regard to the number of demands. In this paper we propose an approach for solving this problem which consists of using the mechanisms...
Houssein Benameur, Brahim Chaib-draa, Peter G. Kro...