Matching problems with Knapsack side constraints

1992 ◽  
pp. 48-89
Author(s):  
U. Derigs ◽  
A. Metz
Keyword(s):  
Matching Problems ◽  
Side Constraints

Matching problems with generalized upper bound side constraints

Networks ◽  
1990 ◽  
Vol 20 (6) ◽  
pp. 703-721 ◽  
Author(s):  
Michael O. Ball ◽  
Ulrich Derigs ◽  
C. Hilbrand ◽  
Achim Metz
Keyword(s):  
Upper Bound ◽  
Matching Problems ◽  
Side Constraints

scholarly journals Entropy-Based Approach in Selection Exact String-Matching Algorithms

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 31
Author(s):  
Ivan Markić ◽  
Maja Štula ◽  
Marija Zorić ◽  
Darko Stipaničev
Keyword(s):  
String Matching ◽  
Quantitative Measure ◽  
Search Pattern ◽  
Maximum Efficiency ◽  
Resource Usage ◽  
Specific Domain ◽  
Matching Problems ◽  
Algorithm Efficiency ◽  
Testing Algorithm ◽  
Algorithm Implementation

The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case. Expressing, measuring, and testing algorithm efficiency is a challenging task with many potential pitfalls. Algorithm efficiency can be measured based on the usage of different resources. In software engineering, algorithmic productivity is a property of an algorithm execution identified with the computational resources the algorithm consumes. Resource usage in algorithm execution could be determined, and for maximum efficiency, the goal is to minimize resource usage. Guided by the fact that standard measures of algorithm efficiency, such as execution time, directly depend on the number of executed actions. Without touching the problematics of computer power consumption or memory, which also depends on the algorithm type and the techniques used in algorithm development, we have developed a methodology which enables the researchers to choose an efficient algorithm for a specific domain. String searching algorithms efficiency is usually observed independently from the domain texts being searched. This research paper aims to present the idea that algorithm efficiency depends on the properties of searched string and properties of the texts being searched, accompanied by the theoretical analysis of the proposed approach. In the proposed methodology, algorithm efficiency is expressed through character comparison count metrics. The character comparison count metrics is a formal quantitative measure independent of algorithm implementation subtleties and computer platform differences. The model is developed for a particular problem domain by using appropriate domain data (patterns and texts) and provides for a specific domain the ranking of algorithms according to the patterns’ entropy. The proposed approach is limited to on-line exact string-matching problems based on information entropy for a search pattern. Meticulous empirical testing depicts the methodology implementation and purports soundness of the methodology.

scholarly journals Designing Random Allocation Mechanisms: Theory and Applications

2013 ◽  
Vol 103 (2) ◽  
pp. 585-623 ◽  
Author(s):  
Eric Budish ◽  
Yeon-Koo Che ◽  
Fuhito Kojima ◽  
Paul Milgrom
Keyword(s):  
Resource Allocation ◽  
School Choice ◽  
Real World ◽  
Random Allocation ◽  
Assignment Problems ◽  
Matching Problems ◽  
House Allocation ◽  
Controlled Choice ◽  
Ex Post ◽  
Ex Ante

Randomization is commonplace in everyday resource allocation. We generalize the theory of randomized assignment to accommodate multi-unit allocations and various real-world constraints, such as group-specific quotas (“controlled choice”) in school choice and house allocation, and scheduling and curriculum constraints in course allocation. We develop new mechanisms that are ex ante efficient and fair in these environments, and that incorporate certain non-additive substitutable preferences. We also develop a “utility guarantee” technique that limits ex post unfairness in random allocations, supplementing the ex ante fairness promoted by randomization. This can be applied to multi-unit assignment problems and certain two-sided matching problems. (JEL C78, D82)

Autonomy, Side-constraints and Property

Mind ◽  
1979 ◽  
Vol LXXXVIII (1) ◽  
pp. 263-265
Author(s):  
D. R. KNOWLES
Keyword(s):  
Side Constraints
Sign in / Sign up

Export Citation Format

Share Document