Affinity in the selection of a player

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent research on sports management, Gil-Lafuente (2002) puts forward a set of algorithms that are capable of resolving, from a scientific point of view, the problems faced by every person responsible for allocation of financial resources of a sports club. One of the questions of interest is the formation of groups of players who are substitutable among each other within the framework of team play. This is an essential matter that should be addressed prior to obtaining an order of preference among them. The proposed algorithms that are capable of providing a good solution to the problem were based on the theory of affinities. Inspired by these results, we propose an extension of the algorithm for the selection of a player, contributing elements that allow us to arrive at more general results. With this, and with no modification whatsoever, we have opened up a new path in the treatment of the proposed problem, in the event of a certain amount of uncertainty in the information. To address this case, we have started out with estimates made by means of intervals and also triplets or quadruples of confidence. Finally we have presented, within the extended concept of affinity, an algorithm based on the product of relations. We conclude by pointing out some alternative approaches to the concept of affinity, which we plan to develop in future works. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gil-Aluja, J., & Gil-Lafuente, A. M. (2010). Affinity in the selection of a player. In Optimal Strategies in Sports Economics and Management (pp. 1–14). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-13205-6_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free