Computer implementation of bankruptcy rules
- Autores
- Saavedra, Verónica; Lopez, Marcelo; Quintas, Luis Guillermo
- Año de publicación
- 2004
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- In this paper we describe a computer system that calculates allocation to claims according to two kinds of bankruptcy rules. The first kind implemented are those whose results corresponds to the classical solutions of game theory: The Talmud rule, the Proportional rule, the Adjusted Proportional rule, the Constrained Equal Awards rule and the Random Arrival rule. The second type implemented generates assignations to claims that have no correspondence with the classical results, they are: Piniles´ rule, the Constrained Egalitarian rule and Constrained Equal Losses rule. This computer system was developed in order to compute the different allocations to claims in Allocation problems, distribution problems and Assignment problems for real cases and to be used in education of game theory and decision problems. The system generates numerical and graphical results. It allows comparisons between the numerical results and their graphic representations. It also allows the exportation of the different outputs to any windows application.
Eje: V - Workshop de agentes y sistemas inteligentes
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Computer System
Bankruptcy Rules
Cooperative Games Education
Game Theory Teaching
ARTIFICIAL INTELLIGENCE
Intelligent agents - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/22517
Ver los metadatos del registro completo
id |
SEDICI_74dc8856ba50783e822d42ccfa8da823 |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/22517 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Computer implementation of bankruptcy rulesSaavedra, VerónicaLopez, MarceloQuintas, Luis GuillermoCiencias InformáticasComputer SystemBankruptcy RulesCooperative Games EducationGame Theory TeachingARTIFICIAL INTELLIGENCEIntelligent agentsIn this paper we describe a computer system that calculates allocation to claims according to two kinds of bankruptcy rules. The first kind implemented are those whose results corresponds to the classical solutions of game theory: The Talmud rule, the Proportional rule, the Adjusted Proportional rule, the Constrained Equal Awards rule and the Random Arrival rule. The second type implemented generates assignations to claims that have no correspondence with the classical results, they are: Piniles´ rule, the Constrained Egalitarian rule and Constrained Equal Losses rule. This computer system was developed in order to compute the different allocations to claims in Allocation problems, distribution problems and Assignment problems for real cases and to be used in education of game theory and decision problems. The system generates numerical and graphical results. It allows comparisons between the numerical results and their graphic representations. It also allows the exportation of the different outputs to any windows application.Eje: V - Workshop de agentes y sistemas inteligentesRed de Universidades con Carreras en Informática (RedUNCI)2004info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/22517enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:55:02Zoai:sedici.unlp.edu.ar:10915/22517Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:55:03.332SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Computer implementation of bankruptcy rules |
title |
Computer implementation of bankruptcy rules |
spellingShingle |
Computer implementation of bankruptcy rules Saavedra, Verónica Ciencias Informáticas Computer System Bankruptcy Rules Cooperative Games Education Game Theory Teaching ARTIFICIAL INTELLIGENCE Intelligent agents |
title_short |
Computer implementation of bankruptcy rules |
title_full |
Computer implementation of bankruptcy rules |
title_fullStr |
Computer implementation of bankruptcy rules |
title_full_unstemmed |
Computer implementation of bankruptcy rules |
title_sort |
Computer implementation of bankruptcy rules |
dc.creator.none.fl_str_mv |
Saavedra, Verónica Lopez, Marcelo Quintas, Luis Guillermo |
author |
Saavedra, Verónica |
author_facet |
Saavedra, Verónica Lopez, Marcelo Quintas, Luis Guillermo |
author_role |
author |
author2 |
Lopez, Marcelo Quintas, Luis Guillermo |
author2_role |
author author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas Computer System Bankruptcy Rules Cooperative Games Education Game Theory Teaching ARTIFICIAL INTELLIGENCE Intelligent agents |
topic |
Ciencias Informáticas Computer System Bankruptcy Rules Cooperative Games Education Game Theory Teaching ARTIFICIAL INTELLIGENCE Intelligent agents |
dc.description.none.fl_txt_mv |
In this paper we describe a computer system that calculates allocation to claims according to two kinds of bankruptcy rules. The first kind implemented are those whose results corresponds to the classical solutions of game theory: The Talmud rule, the Proportional rule, the Adjusted Proportional rule, the Constrained Equal Awards rule and the Random Arrival rule. The second type implemented generates assignations to claims that have no correspondence with the classical results, they are: Piniles´ rule, the Constrained Egalitarian rule and Constrained Equal Losses rule. This computer system was developed in order to compute the different allocations to claims in Allocation problems, distribution problems and Assignment problems for real cases and to be used in education of game theory and decision problems. The system generates numerical and graphical results. It allows comparisons between the numerical results and their graphic representations. It also allows the exportation of the different outputs to any windows application. Eje: V - Workshop de agentes y sistemas inteligentes Red de Universidades con Carreras en Informática (RedUNCI) |
description |
In this paper we describe a computer system that calculates allocation to claims according to two kinds of bankruptcy rules. The first kind implemented are those whose results corresponds to the classical solutions of game theory: The Talmud rule, the Proportional rule, the Adjusted Proportional rule, the Constrained Equal Awards rule and the Random Arrival rule. The second type implemented generates assignations to claims that have no correspondence with the classical results, they are: Piniles´ rule, the Constrained Egalitarian rule and Constrained Equal Losses rule. This computer system was developed in order to compute the different allocations to claims in Allocation problems, distribution problems and Assignment problems for real cases and to be used in education of game theory and decision problems. The system generates numerical and graphical results. It allows comparisons between the numerical results and their graphic representations. It also allows the exportation of the different outputs to any windows application. |
publishDate |
2004 |
dc.date.none.fl_str_mv |
2004 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/22517 |
url |
http://sedici.unlp.edu.ar/handle/10915/22517 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1844615809534525440 |
score |
13.069144 |