Loading...
Search for: winner-determination
0.005 seconds

    A multi-dimensional fairness combinatorial double-sided auction model in cloud environment

    , Article 2016 8th International Symposium on Telecommunications, IST 2016, 27 September 2016 through 29 September 2016 ; 2017 , Pages 672-677 ; 9781509034345 (ISBN) Hassanzadeh, R ; Movaghar, A ; Hassanzadeh, H. R ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2017
    Abstract
    In cloud investment markets, consumers are looking for the lowest cost and a desirable fairness while providers are looking for strategies to achieve the highest possible profit and return. Most existing models for auction-based resource allocation in cloud environments only consider the overall profit increase and ignore the profit of each participant individually or the difference between the rich and the poor participants. This paper proposes a multi-dimensional fairness combinatorial double auction (MDFCDA) model which strikes a balance between the revenue and the fairness among participants. We solve a winner determination problem (WDP) through integer programming which incorporates the... 

    A framework to exploit the structure of and solve set packing problems with a semi-block-angular structure

    , Article Computers and Industrial Engineering ; Volume 137 , 2019 ; 03608352 (ISSN) Radman, M ; Eshghi, K ; Sharif University of Technology
    Elsevier Ltd  2019
    Abstract
    Real-world, large-scale problems often have coefficient matrices with special structures that can be obtained by reordering their rows and columns. One fundamental problem in the field of combinatorial optimization is the Set Packing Problem (SPP), which takes on added significance in view of its far-reaching applications in routing and scheduling problems, scheduling surgical procedures, the winner determination problem, forestry, production management, etc. The coefficient matrix of this problem has low density (the number of 1’s is much less than the number of 0’s in the matrix); therefore, by reordering the matrix, one can aggregate its 1’s in order to exploit special structures like... 

    Scheduling TV commercials using genetic algorithms

    , Article International Journal of Production Research ; Volume 51, Issue 16 , 2013 , Pages 4921-4929 ; 00207543 (ISSN) Ghassemi Tari, F ; 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...