Skip to main content

Dominance, the D-core and stable sets

  • Chapter
Introduction to Game Theory

Part of the book series: Texts and Readings in Mathematics ((TRM))

  • 315 Accesses

Abstract

Let 〈N, υ〉 be an n-person game. Let y, zI(υ), S ∈ 2N\{φ}. We say that y dominates z via coalition S, denoted by y domS z, if

  1. (i)

    yi > zi for all iS,

  2. (ii)

    ΣiSyiυ(S).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 33.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Hindustan Book Agency

About this chapter

Cite this chapter

Tijs, S. (2003). Dominance, the D-core and stable sets. In: Introduction to Game Theory. Texts and Readings in Mathematics. Hindustan Book Agency, Gurgaon. https://doi.org/10.1007/978-93-86279-17-0_13

Download citation

Publish with us

Policies and ethics