The Core can be Accessed with a Bounded Number of Blocks

L.Á. Kóczy

doi:10.1016/j.jmateco.2006.09.002

The Core can be Accessed with a Bounded Number of Blocks

L.Á. Kóczy^*

^*Corresponding author for this work

Microeconomics & Public Economics

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

We show the existence of an upper bound for the number of blocks required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the tu game considered. For the class of games with non-empty cores this means that the core can be reached via a bounded sequence of blocks.

Original language	English
Pages (from-to)	56-64
Number of pages	9
Journal	Journal of Mathematical Economics
Volume	43
Issue number	1
DOIs	https://doi.org/10.1016/j.jmateco.2006.09.002
Publication status	Published - 1 Jan 2006

Access to Document

10.1016/j.jmateco.2006.09.002

Cite this

@article{0a1aacb971504c15aa353c2952aba97a,

title = "The Core can be Accessed with a Bounded Number of Blocks",

abstract = "We show the existence of an upper bound for the number of blocks required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the tu game considered. For the class of games with non-empty cores this means that the core can be reached via a bounded sequence of blocks.",

author = "L.{\'A}. K{\'o}czy",

year = "2006",

month = jan,

day = "1",

doi = "10.1016/j.jmateco.2006.09.002",

language = "English",

volume = "43",

pages = "56--64",

journal = "Journal of Mathematical Economics",

issn = "0304-4068",

publisher = "Elsevier Science",

number = "1",

}

TY - JOUR

T1 - The Core can be Accessed with a Bounded Number of Blocks

AU - Kóczy, L.Á.

PY - 2006/1/1

Y1 - 2006/1/1

N2 - We show the existence of an upper bound for the number of blocks required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the tu game considered. For the class of games with non-empty cores this means that the core can be reached via a bounded sequence of blocks.

AB - We show the existence of an upper bound for the number of blocks required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the tu game considered. For the class of games with non-empty cores this means that the core can be reached via a bounded sequence of blocks.

U2 - 10.1016/j.jmateco.2006.09.002

DO - 10.1016/j.jmateco.2006.09.002

M3 - Article

SN - 0304-4068

VL - 43

SP - 56

EP - 64

JO - Journal of Mathematical Economics

JF - Journal of Mathematical Economics

IS - 1

ER -