scholarly journals A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways

2018 ◽  
Vol 93 ◽  
pp. 15-26 ◽  
Author(s):  
Shahrzad M. Pour ◽  
John H. Drake ◽  
Edmund K. Burke
Keyword(s):  
Choice Function

A Comment on Arrow’s Impossibility Theorem

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Alec Sandroni ◽  
Alvaro Sandroni
Keyword(s):  
Social Choice ◽  
Choice Function ◽  
Social Preference ◽  
Social Choice Function ◽  
Individual Preference ◽  
Impossibility Theorem ◽  
Preference Order ◽  
Individual Choice ◽  
Choice Functions ◽  
Preference Orders

AbstractArrow (1950) famously showed the impossibility of aggregating individual preference orders into a social preference order (together with basic desiderata). This paper shows that it is possible to aggregate individual choice functions, that satisfy almost any condition weaker than WARP, into a social choice function that satisfy the same condition (and also Arrow’s desiderata).

scholarly journals On the direct product of choice function.

2012 ◽  
Vol 18 (3) ◽  
Author(s):  
Bina Ramamurthy ◽  
Vũ Nghĩa ◽  
Vũ Đức Thi
Keyword(s):  
Direct Product ◽  
Choice Function

Products of some special compact spaces and restricted forms of AC

2010 ◽  
Vol 75 (3) ◽  
pp. 996-1006 ◽  
Author(s):  
Kyriakos Keremedis ◽  
Eleftherios Tachtsis
Keyword(s):  
Set Theory ◽  
Closed Subset ◽  
Choice Function ◽  
Ordinal Number ◽  
Axiom Of Choice ◽  
Finite Support ◽  
Compact Spaces ◽  
The Axiom Of Choice ◽  
Infinite Set

AbstractWe establish the following results:1. In ZF (i.e., Zermelo-Fraenkel set theory minus the Axiom of Choice AC), for every set I and for every ordinal number α ≥ ω, the following statements are equivalent:(a) The Tychonoff product of ∣α∣ many non-empty finite discrete subsets of I is compact.(b) The union of ∣α∣ many non-empty finite subsets of I is well orderable.2. The statement: For every infinite set I, every closed subset of the Tychonoff product [0, 1]Iwhich consists offunctions with finite support is compact, is not provable in ZF set theory.3. The statement: For every set I, the principle of dependent choices relativised to I implies the Tychonoff product of countably many non-empty finite discrete subsets of I is compact, is not provable in ZF0 (i.e., ZF minus the Axiom of Regularity).4. The statement: For every set I, every ℵ0-sized family of non-empty finite subsets of I has a choice function implies the Tychonoff product of ℵ0many non-empty finite discrete subsets of I is compact, is not provable in ZF0.

Smooth approximations by continuous choice-functions

2021 ◽  
Author(s):  
Mihai Prunescu
Keyword(s):  
Error Bound ◽  
Common Sense ◽  
Choice Function ◽  
Continuous Functions ◽  
Ordered Sets ◽  
Choice Functions ◽  
Continuous Choice ◽  
Functions Of Two Variables ◽  
Smooth Approximations

Abstract We explore the existence of rational-valued approximation processes by continuous functions of two variables, such that the output continuously depends of the imposed error-bound. To this sake we prove that the theory of densely ordered sets with generic predicates is ℵ0- categorical. A model of the theory and a particular continuous choice-function are constructed. This function transfers to all other models by the respective isomorphisms. If some common-sense conditions are fulfilled, the processes are computable. As a byproduct, other functions with surprising properties can be constructed.

Sign in / Sign up

Export Citation Format

Share Document