Counting combinatorial choice rules
نویسندگان
چکیده
منابع مشابه
Counting combinatorial choice rules
I count the number of combinatorial choice rules that satisfy certain properties: Kelso–Crawford substitutability, and independence of irrelevant alternatives. The results are important for two-sided matching theory, where agents are modeled by combinatorial choice rules with these properties. The rules are a small, and asymptotically vanishing, fraction of all choice rules. But they are still ...
متن کاملCounting Models using Extension Rules
In recent years we have viewed tremendous improvements in the field of Propositional satisfiability (SAT). Many NPcomplete problems from a variety of domains, such as classic planning problems (Kautz 1999), have been compiled into SAT instances, and solved effectively by SAT solvers (Zhang et al 2001). On the other hand, the problem of counting the number of models of a prepositional formula (#...
متن کاملUncovered set choice rules
I study necessary and sufficient conditions for a choice function to be rationalised in the following sense: there exists a complete asymmetric relation T (a tournament) such that for each feasible (finite) choice situation, the choice coincides with the uncovered set of T . This notion of rationality explains not only cyclical and contextdependent choices observed in practice, but also provide...
متن کاملThe Distance Approach to Approximate Combinatorial Counting
We develop general methods to obtain fast (polynomial time) estimates of the cardinality of a combinatorially defined set via solving some randomly generated optimization problems on the set. Examples include enumeration of perfect matchings in a graph, linearly independent subsets of a set of vectors and colored spanning subgraphs of a graph. Geometrically, we estimate the cardinality of a sub...
متن کاملChoice Rules and Accumulator Networks
This article presents a preference accumulation model that can be used to implement a number of different multi-attribute heuristic choice rules, including the lexicographic rule, the majority of confirming dimensions (tallying) rule and the equal weights rule. The proposed model differs from existing accumulators in terms of attribute representation: Leakage and competition, typically applied ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games and Economic Behavior
سال: 2007
ISSN: 0899-8256
DOI: 10.1016/j.geb.2006.03.009