About: Old and new solutions for bargaining problems     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • We are concerned with modeling situations in which rational individuals can conclude profitable agreements but they may disagree about which agreement to conclude. Since Nash's papers on bargaining and Raiffa's studies on arbitration in the beginning of 1950's, it has been customary to formulate this problem as a nonempty collection B of pairs (S, d) where each S from B is a nonempty subset of a finite-dimensional real linear space IRn and d is a point in S. The elements of S are usually interpreted as the utility tuples that the players can obtain by cooperating, and d as the outcome when the players do not cooperate. We deal with point-valued solutions; that is, we wish to find a mapping from B into IRn which satisfies some plausible conditions like; for example, individual rationality, Pareto optimality, anonymity. First we present major models (some old, some recent) and their solution concepts. Then we propose some directions for future research. In particular, we discuss some of the solution functions that are called sequential solutions or stepwise solutions. These solutions are constructed with the help of two functions defined on B: a step function that gradually changes the point d while S is kept unchanged, and a solution function that assigns to (S,d) the limit of the sequence of points constructed by the step function.
  • We are concerned with modeling situations in which rational individuals can conclude profitable agreements but they may disagree about which agreement to conclude. Since Nash's papers on bargaining and Raiffa's studies on arbitration in the beginning of 1950's, it has been customary to formulate this problem as a nonempty collection B of pairs (S, d) where each S from B is a nonempty subset of a finite-dimensional real linear space IRn and d is a point in S. The elements of S are usually interpreted as the utility tuples that the players can obtain by cooperating, and d as the outcome when the players do not cooperate. We deal with point-valued solutions; that is, we wish to find a mapping from B into IRn which satisfies some plausible conditions like; for example, individual rationality, Pareto optimality, anonymity. First we present major models (some old, some recent) and their solution concepts. Then we propose some directions for future research. In particular, we discuss some of the solution functions that are called sequential solutions or stepwise solutions. These solutions are constructed with the help of two functions defined on B: a step function that gradually changes the point d while S is kept unchanged, and a solution function that assigns to (S,d) the limit of the sequence of points constructed by the step function. (en)
Title
  • Old and new solutions for bargaining problems
  • Old and new solutions for bargaining problems (en)
skos:prefLabel
  • Old and new solutions for bargaining problems
  • Old and new solutions for bargaining problems (en)
skos:notation
  • RIV/00216208:11320/13:10189388!RIV14-MSM-11320___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • I
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 93577
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/13:10189388
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Raiffa's solution; ordinal solution; sequential solution; arbitration; Bargaining (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [39C10FC7C77D]
http://linked.open...v/mistoKonaniAkce
  • Valašské Meziříčí
http://linked.open...i/riv/mistoVydani
  • Ostrava
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 10th International Conference on Strategic Management and its Support by Information Systems
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Vlach, Milan
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000324842000022
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Vysoká škola báňská - Technická univerzita Ostrava
https://schema.org/isbn
  • 978-80-248-3096-4
http://localhost/t...ganizacniJednotka
  • 11320
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software