A crucial assumption in the optimal auction literature is that each bidder’s valuation is known to be drawn from a unique distribution. In this paper, we study the optimal auction problem allowing for ambiguity about the distribution of valuations. Agents may be ambiguity averse (modeled using the maxmin expected utility model of Gilboa and Schmeidler 1989). When the bidders face more ambiguity...

Recent machine learning methods for sequential behavior prediction estimate the motives of behavior rather than the behavior itself. This higher-level abstraction improves generalization in different prediction settings, but computing predictions often becomes intractable in large decision spaces. We propose the Softstar algorithm, a softened heuristic-guided search technique for the maximum en...

5 We present an extension of Voronoi diagrams where when considering which site a client 6 is going to use, in addition to the site distances, other site attributes are also considered (i.e., 7 prices or weights). A cell in this diagram is then the loci of all clients that consider the same set 8 of sites to be relevant. In particular, the precise site a client might use from this candidate set...

Module checking has been introduced in late 1990s to verify open systems, i.e., systems whose behavior depends on the continuous interaction with the environment. Classically, module checking has been investigated with respect to specifications given as CTL and CTL∗ formulas. Recently, it has been shown that CTL (resp., CTL∗) module checking offers a distinctly different perspective from the be...

This paper considers the problem of designing a state feedback control law which minimizes multiple quadratic performance objectives in the presence of uncertain linear plant dynamics Vec tor optimization techniques are used to minimize upper bounds on each performance objective guaranteed cost By exploiting the linear uncertainty bound introduced by Bernstein the vector optimization problem is...

A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that pro...

Regarding the increase in needs of human societies to agricultural products, increasing water use efficiency can lead to persistent use of limited water resources. Therefore, in this study using Data Envelopment Analysis (DEA), technical, allocative, managerial and economic efficiency and also Optimal level of inputs is surveyed in order to achieve maximum Efficiency in Marvdasht city in 20...

Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...

h a stochastic and fuzzy environment, a multiobjective fuzzy stopping problem is discussed. The randomness and fuzziness are evaluated by probabilistic expectations and linear ranking functions, respectively. Pareto optimal fuzzy stopping times are given under the assumption of regularity for stopping rules, by using X-optimal stopping times. @ 2003 Elsevier Ltd. All rights reserved. &Fords-Mul...