Loading...
Search for:
combinatorial-auction
0.006 seconds
Implementing heterogeneous agents in dynamic environments, a case study in RoboCupRescue
, Article First German Conference, MATES 2003, Erfurt, 22 September 2003 through 25 September 2003 ; Volume 2831 , 2003 , Pages 95-104 ; 03029743 (ISSN) ; Ahmadi, M ; Nouri, A ; Sayyadian, M ; Nevisi, M. M ; Sharif University of Technology
Springer Verlag
2003
Abstract
Design and construction of multi-agent systems is a challenging but an intriguing problem. It is because of the intrinsic distribution of the intelligent components. In such environments the interaction and communication between the constituent parts extends the complexity since appropriate coordination methods need to be designated and employed. In this paper a successful experiment in designing and implementing such an environment is presented1. The test bed for this research is the rescue simulation environment. The architecture of the implemented heterogeneous agents takes advantage of various algorithms. These algorithms make the agents act intelligently by themselves albeit they happen...
Providing a Multi-Attribute Combinatorial Double Auction Model for Resource Allocation in the Cloud Environmet
, M.Sc. Thesis Sharif University of Technology ; Movaghar Rahimabadi, Ali (Supervisor)
Abstract
In auction-based cloud investment environments, consumers desire the least possible cost and high satisfaction, while providers seek strategies to maximize profit and return on investment. In these environments designing an adequate resource allocation that can satisfy both consumers and providers is of utmost importance. Yet, most available models in resource allocation focus on providers’ needs and do not concern themselves with the consumers. Therefore the present study aims to present an efficient and optimum model for resource allocation problem that takes into account various factors, e.g. resource price, service quality, reputation and fairness, and is capable of satisfying all honest...
A Hybrid Simulated Annealing Algorithm For Winner Determination problem In Combinatorial Auction
, M.Sc. Thesis Sharif University of Technology ; Kianfar, Farhad (Supervisor)
Abstract
One of the most important issues that an organization faced with is resource management. The proper resource management has the great rule in organization cost reduction. One of the most efficient processes in resource allocation is auction and there is different auction with different mechanism and goals. In an auction there is a set of items and a set of bids, and the task of auctioneer is matching items with suitable bids. Each bid consist of desirable items and the bidder value of that items. In an auction process, after mechanism design of auction and auction implementation we must identify the winners of auction and this is a hard problem even in simple auction.
In this study we...
In this study we...
Scheduling TV commercials using genetic algorithms
, Article International Journal of Production Research ; Volume 51, Issue 16 , 2013 , Pages 4921-4929 ; 00207543 (ISSN) ; Alaei, R ; Sharif University of Technology
2013
Abstract
In this paper, the problem of scheduling commercial messages during the peak of viewing time of a TV channel is formulated as a combinatorial auction-based mathematical programming model. Through this model, a profitable and efficient mechanism for allocating the advertising time to advertisers is developed by which the revenue of TV channels is maximised while the effectiveness of advertising is increased. We developed a steady-state genetic algorithm to find an optimal or a near optimal solution for the proposed problem. A computational experiment was conducted for evaluating the efficiency of the proposed algorithm. A set of test problems with different sizes were generated, using the...