Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility Location

Obvious strategyproofness (OSP) is an appealing concept as it allows to maintain incentive compatibility even in the presence of agents that are not fully rational, i.e., those who struggle with contingent reasoning (Li in Am Econ Rev 107(11):3257–3287, 2017). However, it has been shown to impose some limitations, e.g., no OSP mechanism can return a stable matching (Ashlagi and Gonczarowski in J Econ Theory 177:405–425, 2018). We here deepen the study of the limitations of OSP mechanisms by looking at their approximation guarantees for basic optimization problems paradigmatic of the area, i.e., machine scheduling and facility location. We prove a number of bounds on the approximation guarantee of OSP mechanisms, which show that OSP can come at a significant cost. However, rather surprisingly, we prove that OSP mechanisms can return optimal solutions when they use monitoring—a novel mechanism design paradigm that introduces a mild level of scrutiny on agents’ declarations (Kovács et al. in WINE 9470:398–412, 2015).

A Comparison of Optimization Algorithms for Deep Learning

In recent years, we have witnessed the rise of deep learning. Deep neural networks have proved their success in many areas. However, the optimization of these networks has become more difficult as neural networks going deeper and datasets becoming bigger. Therefore, more advanced optimization algorithms have been proposed over the past years. In this study, widely used optimization algorithms for deep learning are examined in detail. To this end, these algorithms called adaptive gradient methods are implemented for both supervised and unsupervised tasks. The behavior of the algorithms during training and results on four image datasets, namely, MNIST, CIFAR-10, Kaggle Flowers and Labeled Faces in the Wild are compared by pointing out their differences against basic optimization algorithms.

Optimization of kinematic parameters in single-sided lapping

In this paper the influence of selected kinematic parameters on the geometrical results of the single-sided lapping process was presented. The purpose of parameters optimization is to improve the flatness and quality of the machined surfaces. The basic optimization criterion is the uniformity of tool wear. The simulation and experimental results were presented and compared.

ANALYSIS OF PARAMETERS SERIES OF WIRE CROSS-SECTIONS FOR OVERHEAD POWER LINE DESIGN

In the analysis of the parameters series of wire cross-sections for the overhead power line design taking into account their development prospects, the author solved the following tasks. The study of the existing parameter, which characterizes and determines the optimization option of the technical and economic model for the design of overhead lines, which allowed showing the unreasonableness of using the economic current density as the basic optimization parameter of the technical and economic model of overhead lines is performed. The wire cross-section as the basic optimization parameter of the technical and economic model of overhead lines is proposed. The scale growth factor of the parameters series of wire cross-sections is obtained by the criteria-based method, which allowed developing an optimum scale of wire cross-sections. Estimation of the statistical characteristics of the distribution of the relative value of wire cross-sections is carried out. The introduced hypothesis of a log-normal distribution law of the current density is tested using the Pearson's chi-squared test for finding the relationship of relative variation of the initial information on the scale growth factor of wire cross-sections. The effect of the optimum scale of wire cross-sections on the regulations of reconstruction, which is due to the load rate and growth variations in the power grid is determined.

Integrated Modeling of Process Routes Planning and Scheduling Based on Network Diagram

Modeling method based on network diagram was proposed to realize integrated modeling of process routes planning and scheduling. A model of multiple process routes and resource (MPRR) network diagram was built, which applied the network diagram expression and represented the precedence constraint relationship among operations and resource conditions. In the model, the workpiece, operation and machine are joined together as a basic optimization cell to realize concurrent and holistic optimization for process routes planning and scheduling. An example was studied and the integrated model of process routes planning and scheduling was built.