1 resultado para Perfect matches
em Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest
Filtro por publicador
- Repository Napier (1)
- Aberdeen University (2)
- Aberystwyth University Repository - Reino Unido (6)
- Adam Mickiewicz University Repository (3)
- Aquatic Commons (11)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (25)
- Aston University Research Archive (4)
- B-Digital - Universidade Fernando Pessoa - Portugal (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (3)
- Biblioteca Digital de la Universidad Católica Argentina (7)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (21)
- Blue Tiger Commons - Lincoln University - USA (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (8)
- Boston University Digital Common (17)
- Brock University, Canada (3)
- CaltechTHESIS (28)
- Cambridge University Engineering Department Publications Database (48)
- CentAUR: Central Archive University of Reading - UK (12)
- Center for Jewish History Digital Collections (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (149)
- CORA - Cork Open Research Archive - University College Cork - Ireland (5)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- Dalarna University College Electronic Archive (2)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Peer Publishing (2)
- DigitalCommons@The Texas Medical Center (1)
- DRUM (Digital Repository at the University of Maryland) (5)
- Duke University (17)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (6)
- Greenwich Academic Literature Archive - UK (6)
- Helda - Digital Repository of University of Helsinki (26)
- Indian Institute of Science - Bangalore - Índia (192)
- Instituto Politécnico de Leiria (1)
- Instituto Superior de Psicologia Aplicada - Lisboa (1)
- Massachusetts Institute of Technology (5)
- Ministerio de Cultura, Spain (2)
- National Center for Biotechnology Information - NCBI (2)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (3)
- Portal de Revistas Científicas Complutenses - Espanha (5)
- Publishing Network for Geoscientific & Environmental Data (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (36)
- Queensland University of Technology - ePrints Archive (205)
- Repositório digital da Fundação Getúlio Vargas - FGV (4)
- Repositorio Institucional de la Universidad Nacional Agraria (1)
- Repositorio Institucional de la Universidad Pública de Navarra - Espanha (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (8)
- Research Open Access Repository of the University of East London. (1)
- Universidad de Alicante (1)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (7)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (2)
- Université de Montréal, Canada (2)
- University of Canberra Research Repository - Australia (2)
- University of Michigan (35)
- University of Queensland eSpace - Australia (12)
Resumo:
A correlation scheme (leading to a special equilibrium called “soft” correlated equilibrium) is applied for two-person finite games in extensive form with perfect information. Randomization by an umpire takes place over the leaves of the game tree. At every decision point players have the choice either to follow the recommendation of the umpire blindly or freely choose any other action except the one suggested. This scheme can lead to Pareto-improved outcomes of other correlated equilibria. Computational issues of maximizing a linear function over the set of soft correlated equilibria are considered and a linear-time algorithm in terms of the number of edges in the game tree is given for a special procedure called “subgame perfect optimization”.