The 1998 settlement of a lawsuit by the state of California required 19 pharmaceutical firms to provide $150 million worth of drugs free of charge to more than 150 California clinics and hospitals over a three-year period. We developed a decision-support system that utilizes a multiobjective optimization model and a heuristic solution taking into account the efficiency, effectiveness, and equit...

introduction: efficiency evaluation of universities and faculties is one of the tools that help managers to identify the departments’ strengths and weakness. the main objective of the present research was to measure and compare the technical efficiency of shiraz school of medicine departments using data envelopment analysis (dea) technique. methods: this cross-sectional and retrospective study ...

This article presents a subcarrier allocation scheme based on a Blotto game (SABG) for orthogonal frequencydivision multiple access (OFDMA) networks where correlation between adjacent subcarriers is considered. In the proposed game, users simultaneously compete for subcarriers using a limited budget. In order to win as many good subcarriers as possible in this game, users are required to wisely...

The problem of subcarrier allocation (SA) and power allocation (PA) for both the downlink and uplink of cognitive radio networks (CRNs) is studied. Two joint SA and PA schemes based on Blotto games are presented for orthogonal frequency-division multiple access (OFDMA)-based CRNs. In this work, the authors consider a more practical scenario by taking into account the correlation between adjacen...

While it is relatively easy to start an online advertising campaign, proper allocation of the marketing budget is far from trivial. A major challenge faced by the marketers attempting to optimize their campaigns is in the sheer number of variables involved, the many individual decisions they make in fixing or changing these variables, and the nontrivial short and long-term interplay among these...

We study the resource allocation game in which price anticipating players compete for multiple divisible resources. In the scheme, each player submits a bid to a resource and receives a share of the resource according to the proportion of his bid to the total bids. Unlike the previous study (e.g. [5]), we consider the case when the players have budget constraints, i.e. each player’s total bids ...

An auctioneer wishes to sell several heterogeneous indivisible items to a group of potential bidders. Each bidder has valuations over the items but may face a budget constraint and therefore be unable to pay up to his values. In such markets, a Walrasian equilibrium may fail to exist. We develop a novel dynamic auction and prove that the auction always finds a core allocation. In the auction pr...