Bargaining and markets: Complexity and the competitive outcome (Q1876641): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Structure of Nash Equilibrium in Repeated Games with Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repeated games, finite automata, and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching and Bargaining in Dynamic Markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary stability in alternating-offers bargaining games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiperson Bargaining and Strategic Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bargaining and Competition Part I: Characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bargaining and Competition Part II: Existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit theorems for markets with sequential bargaining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov equilibria in dynamic matching and bargaining games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncooperative price taking in large dynamic markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strength of a little perfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Rationality and Interpersonal Complexity in Repeated Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Bargaining as a Noncooperative Foundation for Walrasian Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Little perfection and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On players with a bounded number of states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rationalizable Strategic Behavior and the Problem of Perfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata play a repeated extensive game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata play the repeated prisoner's dilemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium in a Market with Sequential Bargaining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decentralized Trading, Strategic Behaviour and the Walrasian Outcome / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymous repeated games with a large number of players and random outcomes / rank
 
Normal rank

Latest revision as of 19:24, 6 June 2024

scientific article
Language Label Description Also known as
English
Bargaining and markets: Complexity and the competitive outcome
scientific article

    Statements

    Bargaining and markets: Complexity and the competitive outcome (English)
    0 references
    0 references
    20 August 2004
    0 references
    The paper investigates the effect of introducing complexity costs of implementing strategies into the dynamic matching and bargaining games. More specifically, it shows that complexity considerations can provide a game-theoretic foundation for the competitive behaviour in decentralised markets with a finite number of agents. Moreover, it shows that in these models, the introduction of complexity costs into players' preferences ensures that in equilibrium, players choose history-independent strategies, sometimes referred to as stationary or Markov strategies.
    0 references
    bargaining games
    0 references
    matching games
    0 references
    complexity costs
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers