An offer you cannot refuse : obtaining efficiency and fairness in preplay negotiation games with conditional offers
- Goranko, Valentin, Turrini, Paolo
- Authors: Goranko, Valentin , Turrini, Paolo
- Date: 2013
- Subjects: Bargaining games , Negotiation games
- Type: Article
- Identifier: uj:6124 , http://hdl.handle.net/10210/12421
- Description: We study a recently introduced extension of normal form games with a phase before the actual play of the game, where each player can make binding offers for payments of utility to the other players after the play of the game, contingent on the recipient playing the strategy indicated in the offer. Such offers transform the payoff matrix of the original game and allow for some degree of cooperation between rational players while preserving the non-cooperative nature of the game. We focus on 2-player negotiations games arising in the preplay phase when offers for payments are made conditional on a suggested matching offer of the same kind being made in return by the receiver.We study and analyze such bargaining games, obtain results describing their possible solutions and discuss the degrees of efficiency and fairness that can be achieved in such negotiation process depending on whether time is valuable or not.
- Full Text:
- Authors: Goranko, Valentin , Turrini, Paolo
- Date: 2013
- Subjects: Bargaining games , Negotiation games
- Type: Article
- Identifier: uj:6124 , http://hdl.handle.net/10210/12421
- Description: We study a recently introduced extension of normal form games with a phase before the actual play of the game, where each player can make binding offers for payments of utility to the other players after the play of the game, contingent on the recipient playing the strategy indicated in the offer. Such offers transform the payoff matrix of the original game and allow for some degree of cooperation between rational players while preserving the non-cooperative nature of the game. We focus on 2-player negotiations games arising in the preplay phase when offers for payments are made conditional on a suggested matching offer of the same kind being made in return by the receiver.We study and analyze such bargaining games, obtain results describing their possible solutions and discuss the degrees of efficiency and fairness that can be achieved in such negotiation process depending on whether time is valuable or not.
- Full Text:
State and path coalition effectivity models for logics of multi-player games
- Goranko, Valentin, Jamroga, Wojciech
- Authors: Goranko, Valentin , Jamroga, Wojciech
- Date: 2012
- Subjects: Games models , Strategic logic , Multi-player games
- Type: Article
- Identifier: uj:6050 , ISBN 978-0-9817381-79-3 , http://hdl.handle.net/10210/10461
- Description: Please refer to full text to view abstract
- Full Text:
- Authors: Goranko, Valentin , Jamroga, Wojciech
- Date: 2012
- Subjects: Games models , Strategic logic , Multi-player games
- Type: Article
- Identifier: uj:6050 , ISBN 978-0-9817381-79-3 , http://hdl.handle.net/10210/10461
- Description: Please refer to full text to view abstract
- Full Text:
Classes and theories of trees associated with a class of linear orders
- Goranko, Valentin, Kellerman, Ruaan
- Authors: Goranko, Valentin , Kellerman, Ruaan
- Date: 2010-08
- Subjects: Linear orders , First-order theories , Nondefinable paths , Trees (Graph theory)
- Type: Article
- Identifier: http://ujcontent.uj.ac.za8080/10210/364640 , uj:5832 , ISSN 1367-0751 , http://hdl.handle.net/10210/7849
- Description: Given a class of linear order types C, we identify and study several different classes of trees, naturally associated with C in terms of how the paths in those trees are related to the order types belonging to C. We investigate and completely determine the set-theoretic relationships between these classes of trees and between their corresponding first-order theories. We then obtain some general results about the axiomatization of the first-order theories of some of these classes of trees in terms of the first-order theory of the generating class C, and indicate the problems obstructing such general results for the other classes. These problems arise from the possible existence of nondefinable paths in trees, that need not satisfy the first-order theory of C, so we have started analyzing first-order definable and undefinable paths in trees.
- Full Text:
- Authors: Goranko, Valentin , Kellerman, Ruaan
- Date: 2010-08
- Subjects: Linear orders , First-order theories , Nondefinable paths , Trees (Graph theory)
- Type: Article
- Identifier: http://ujcontent.uj.ac.za8080/10210/364640 , uj:5832 , ISSN 1367-0751 , http://hdl.handle.net/10210/7849
- Description: Given a class of linear order types C, we identify and study several different classes of trees, naturally associated with C in terms of how the paths in those trees are related to the order types belonging to C. We investigate and completely determine the set-theoretic relationships between these classes of trees and between their corresponding first-order theories. We then obtain some general results about the axiomatization of the first-order theories of some of these classes of trees in terms of the first-order theory of the generating class C, and indicate the problems obstructing such general results for the other classes. These problems arise from the possible existence of nondefinable paths in trees, that need not satisfy the first-order theory of C, so we have started analyzing first-order definable and undefinable paths in trees.
- Full Text:
- «
- ‹
- 1
- ›
- »