Please use this identifier to cite or link to this item:
http://hdl.handle.net/10071/29109
Author(s): | Matos, M. C. P. Ferreira, M. A. M. |
Editor: | Blair, S., Chakraborty, U., Chen, S. H., Cheng, H. D., Chiu, D. K. Y., Das, S., Denker, G., Duro, R., Romay, M. G., Hung, D., and Kerre, E. E. |
Date: | 2005 |
Title: | Select and accept |
Volume: | 1 |
Book title/volume: | 8th Joint Conference on Information Sciences 2005 (JCIS 2005) |
Pages: | 532 - 534 |
Event title: | 8th JCIS 2005 |
Reference: | Matos, M. C. P., & Ferreira, M. A. M. (2005). Select and accept. In S. Blair, U. Chakraborty, S. H. Chen, H. D. Cheng, D. K. Y. Chiu, S. Das, G. Denker, R. Duro, M. G. Romay, D. Hung, & E. E. Kerre (Eds.), 8th Joint Conference on Information Sciences 2005 (JCIS 2005) (vol. 1, pp. 532-534). Joint Conference on Information Sciences. |
ISBN: | 9781605603223 |
Keywords: | Game theory Two-part game Code form |
Abstract: | The aim of this paper is to present how to solve the problem of selecting a candidate up to his or her acceptance trough game theory. The originality this paper proposes is how this problem will be approached. It will be treated as a single game which is made up of two parts, going as far as to state that the payoffs in the first part of the game will be the mediators of the second part of the game. In order to represent the problem described above, a new form of game representation will be used – code form – consisting of a table which contains all of the information, without any suppression or “adulteration” with regards to the game |
Peerreviewed: | yes |
Access type: | Open Access |
Appears in Collections: | ISTAR-CRI - Comunicações a conferências internacionais |
Files in This Item:
File | Size | Format | |
---|---|---|---|
conferenceobject_12749.pdf | 1,8 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.