A Taylor-Polynomial Representation of Value Functions for Multi-Attribute Decision Strategies
Decision strategies in multi-attribute decision-making are described as qualitatively distinct rules with no common quantitative scale for comparing them.
Yuki Tamari +4 more
doaj +1 more source
Direct Access for Answers to Conjunctive Queries with Aggregation [PDF]
We study the fine-grained complexity of conjunctive queries with grouping and aggregation. For common aggregate functions (e.g., min, max, count, sum), such a query can be phrased as an ordinary conjunctive query over a database annotated with a suitable
Idan Eldar +2 more
doaj +1 more source
Negative results in the theory of games with lexicographic utilities [PDF]
When players may have lexicographic utilities, there are: (i) extensive games having a non-empty set of equilibria but empty sets of sequentially rational, sequential and perfect equilibria (ii) normal form games having a non-empty set of equilibria but ...
Antonio Quesada
core
Lagrangian Duality for Multiobjective Programming Problems in Lexicographic Order
This paper deals with a constraint multiobjective programming problem and its dual problem in the lexicographic order. We establish some duality theorems and present several existence results of a Lagrange multiplier and a lexicographic saddle point ...
X F Hu, L N Wang
core
Lexicographic Preferences in Discrete Choice Experiments: Consequences on Individual-Specific Willingness to Pay Estimates [PDF]
In discrete choice experiments respondents are generally assumed to consider all of the attributes across each of the alternatives, and to choose their most preferred.
W. George Hutchinson +2 more
core
Where Utility Functions Do Not Exist - A Note on Lexicographic Orders [PDF]
There seems to be some amount of confusion in the finance text books regarding the conditions under which an individual’s preferences can be represented by a utility function.
Varma, Jayanth R.
core
Introduction [Defining collocation for lexicographic purposes]
This volume deals with collocations from a lexicographic perspective by addressing, in detail, the boundaries between collocations and other word combinations, the possibility of adapting the definition of collocation to the objectives of specific ...
Giacomini, Laura, ORLANDI, Adriana
core
From Ordients to Optimization: Substitution Effects without Differentiability [PDF]
This paper introduces the concept of ordient for binary relations (preferences), a relative of the concept of gradients for functions (utilities). The lexicographic order, albeit not representable, has an ordient.
Karl H. Schlag, Ludovic Renou
core
Gröbner Basis Cryptanalysis of Ciminion and Hydra
Ciminion and Hydra are two recently introduced symmetric key Pseudo- Random Functions for Multi-Party Computation applications. For efficiency, both primitives utilize quadratic permutations at round level.
Matthias Johann Steiner
doaj +1 more source
On Solving The Systems of Algebraic Equations Using Gröbner Bases
Described and proved the algorithm for finding some solution of algebraic equations over arbitrary field k for zero dimension ideals if Gröbner basis of this ideal over lexicographic order is given.
Alexander Shokurov
doaj

