Similar Search Results

Sticky market webs of connection : human and nonhuman market co-codification dynamics across social media

Schöps, Jonathan David; Reinhardt, Christian; … - In: European journal of marketing 56 (2022) 13, pp. 78-104

Persistent link: https://www.econbiz.de/10013502335

Ensuring the competitiveness of amalgamated hromadas (territorial communities) under conditions of decentralization of power using modern information technology

Kloba, Lev; Kloba, Solomiia - In: Baltic Journal of Economic Studies 7 (2021) 5, pp. 97-103

Persistent link: https://www.econbiz.de/10013361524

A system for anomaly detection in reverse logistics: an application into an e-commerce company

Elia, Gianluca; Ghiani, Gianpaolo; Manni, Emanuele; … - In: Measuring Business Excellence 28 (2024) 2, pp. 222-242

evidence with secondary data. Findings The paper presents an algorithm and a system to support a more efficient and smart …

Persistent link: https://www.econbiz.de/10015353471

Hybrid data analytic technique for grading fairness

Banditwattanawong, Thepparit; Jankasem, Arnon Marco Polo; … - In: Data Technologies and Applications 57 (2022) 1, pp. 18-31

attain the fairest grading, this paper proposes a hybrid algorithm that integrates z score, K -means and heuristic methods … the algorithm's constituent methods could deliver the fairest grading results with fairness degrees ranging from 0.110 to … algorithm for fair norm-referenced grading, a fairness metric for norm-referenced grading and the fairness performance results …

Persistent link: https://www.econbiz.de/10014712612

Stochastic linear programming with a distortion risk constraint

Bazovkin, Pavel; Mosler, Karl - 2011

solution with respect to the underlying probability. An efficient geometrical algorithm is proposed to solve the SLP. …

Persistent link: https://www.econbiz.de/10010311008

Generalized marginal rate of substitution in multiconstraint consumer's problems and their reciprocal expenditure problems

Besada, Manuel; García, Javier; Mirás, Miguel; … - In: SERIEs - Journal of the Spanish Economic Association 2 (2011) 3, pp. 401-421

The aim of this paper is to explore several features concerning the generalized marginal rate of substitution (GMRS)when the consumers utility maximization problem with several constraints is formulated as a quasi-concave programming problem. We show that a point satisfying the first order...

Persistent link: https://www.econbiz.de/10010317072

Modified whittle estimation of multilateral spatial models

Robinson, P. M.; Sanz, J. Vidal - 2003

We consider the estimation of parametric models for stationary spatial or spatio-temporal data on a d-dimensional lattice, for d ≥ 2. The achievement of asymptotic efficiency under Gaussianity, and asymptotic normality more generally, with standard convergence rate, faces two obstacles. One is...

Persistent link: https://www.econbiz.de/10010318450

Estimation of dynamic linear models in short panels with ordinal observation

Pudney, Stephen E. - 2005

We develop a simulated ML method for short-panel estimation of one or more dynamic linear equations, where the dependent variables are only partially observed through ordinal scales. We argue that this latent autoregression (LAR) model is often more appropriate than the usual state-dependence...

Persistent link: https://www.econbiz.de/10010318504

Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness

Chiappori, Pierre-André; McCann, Robert J.; Nesheim, Lars - 2007

Hedonic pricing with quasilinear preferences is shown to be equivalent to stable matching with transferable utilities and a participation constraint, and to an optimal transportation (Monge-Kantorovich) linear programming problem. Optimal assignments in the latter correspond to stable matchings,...

Persistent link: https://www.econbiz.de/10010318563

Intersection bounds: Estimation and inference

Chernozhukov, Victor; Lee, Sokbae; Rosen, Adam - 2012

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. We show that...

Persistent link: https://www.econbiz.de/10010318689