There are p heterogeneous objects to be assigned to n competing agents (n > p) each with unit demand. It is required to design a Groves mechanism for this assignment problem satisfying weak budget balance, individual rationality, and minimizing the budget imbalance. This calls for designing an appropriate rebate function. Our main result is an impossibility theorem which rules out linear rebate...

Crowdsensing has attracted more and more attention in recent years, which can help companies or data demanders to collect large amounts of data efficiently and cheaply. In a crowdsensing system, the sensing tasks are divided into many small sub-tasks that can be easily accomplished by smartphone users, and the companies take advantage of the data collected by all the smartphone users to improve...

Advances in storage technology have introduced Non-Volatile Memory, NVM, as a new storage medium. NVM, along with DRAM, NAND Flash, and Disk present a system designer with a wide array of options in designing caching middleware. This paper provides a systematic way to use knowledge about the frequencies of read and write requests to individual data items in order to determine the optimal cache ...

Increasing accessibility and affordability of healthcare services has been considered as an important policy objective since the beginning of 1980s in Iran. However, current 60- 70% health care out-of-pocket payments create a barrier to an equal access to quality health services, especially in terms of new medicines which affects equity issues and "health" in Iran. Currently, health insurance o...

The issue of how to improve the usability data publishing under differential privacy has become one top questions in field machine learning protection, and key solving this problem is allocate a reasonable protection budget. To solve problem, we design budget allocation algorithm based on out-of-bag estimation random forest. firstly calculates decision tree weights feature by protection. Second...

We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associated with the nodes, the goal is to find a connected subgraph that contains a subset of distinguished vertices. In this work we focus on the budget-constrained version, where we maximize the total profit of the nodes in the subgra...

In this paper we introduce a new approach to rare event simulation. Because of the extensive simulation required for precise estimation of performance criterion dependent on rare event occurrences, obstacles such as computing budget/time constraints and pseudo-random number generator limitations can become prohibitive, particularly if comparative study of different system designs is involved. E...

We propose novel methods for maxcost Discrete Function Evaluation Problem (DFEP) under budget constraints. We are motivated by applications such as clinical diagnosis where a patient is subjected to a sequence of (possibly expensive) tests before a decision is made. Our goal is to develop strategies for minimizing max-costs. The problem is known to be NP hard and greedy methods based on special...

In this paper, we study the problem of selecting a system that has the best performance or selecting one of the best systems when the objective function is the expected performance of a complex stochastic system. The focus here is on a huge size but finite feasible solution set, that is not necessarily well structured. We consider the use of the ordinal optimization technique that concerns with...