Minimax-regret strategies for bargaining over several variables (Q1262188): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0531(89)90123-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968174942 / rank
 
Normal rank

Revision as of 01:25, 20 March 2024

scientific article
Language Label Description Also known as
English
Minimax-regret strategies for bargaining over several variables
scientific article

    Statements

    Minimax-regret strategies for bargaining over several variables (English)
    0 references
    0 references
    0 references
    1989
    0 references
    For the sealed-bid mechanism for bilateral bargaining, we explore models in which each player bids so as to minimize his maximum regret. Here regret is defined as the difference between the profit the player could have made with the wisdom of hindsight and the profit he actually made. We study bargaining over both price and quantity, as well as over more general sets of bargaining alternatives, with complete and incomplete information. In each case there is a minimax-regret strategy that is linear in the true value or cost, and the minmax regret is not ``unacceptably'' large.
    0 references
    sealed-bid mechanism
    0 references
    bilateral bargaining
    0 references
    incomplete information
    0 references
    minimax-regret strategy
    0 references

    Identifiers