Advanced Search
MyIDEAS: Login

Computing the cores of strategic games with punishment–dominance relations

Contents:

Author Info

  • Takuya Masuzawa

    ()

Registered author(s):

    Abstract

    No abstract is available for this item.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://hdl.handle.net/10.1007/s00182-007-0104-3
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Springer in its journal International Journal of Game Theory.

    Volume (Year): 37 (2008)
    Issue (Month): 2 (June)
    Pages: 185-201

    as in new window
    Handle: RePEc:spr:jogath:v:37:y:2008:i:2:p:185-201

    Contact details of provider:
    Web page: http://link.springer.de/link/service/journals/00182/index.htm

    Order Information:
    Web: http://link.springer.de/orders.htm

    Related research

    Keywords: Polynomial-time algorithms; NTU games; The α-core; Reduced games; Public good provision;

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Thomson, W., 1996. "Consistent Allocation Rules," RCER Working Papers 418, University of Rochester - Center for Economic Research (RCER).
    2. Peleg, B. & Tijs, S., 1993. "The Consistency Principle for Games in Strategic Form," Papers 9306, Tilburg - Center for Economic Research.
    3. Ruud Hendrickx & Judith Timmer & Peter Borm, 2002. "A note on NTU convexity," International Journal of Game Theory, Springer, vol. 31(1), pages 29-37.
    4. Milgrom, Paul & Roberts, John, 1996. "Coalition-Proofness and Correlation with Arbitrary Communication Possibilities," Games and Economic Behavior, Elsevier, vol. 17(1), pages 113-128, November.
    5. Jeroen Kuipers & Ulrich Faigle & Walter Kern, 2001. "On the computation of the nucleolus of a cooperative game," International Journal of Game Theory, Springer, vol. 30(1), pages 79-98.
    6. Rahul Savani & Bernhard Stengel, 2006. "Hard-to-Solve Bimatrix Games," Econometrica, Econometric Society, vol. 74(2), pages 397-429, 03.
    7. Herbert E. Scarf, 1965. "The Core of an N Person Game," Cowles Foundation Discussion Papers 182R, Cowles Foundation for Research in Economics, Yale University.
    8. Von Stengel, Bernhard, 2002. "Computing equilibria for two-person games," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 45, pages 1723-1759 Elsevier.
    9. McKelvey, Richard D. & McLennan, Andrew, 1996. "Computation of equilibria in finite games," Handbook of Computational Economics, in: H. M. Amman & D. A. Kendrick & J. Rust (ed.), Handbook of Computational Economics, edition 1, volume 1, chapter 2, pages 87-142 Elsevier.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Takuya Masuzawa, 2013. "Metzler Functions and the Shortest-Path Problem," Keio/Kyoto Joint Global COE Discussion Paper Series 2012-030, Keio/Kyoto Joint Global COE Program.
    2. Takuya Masuzawa, 2012. "A Simple and Constructive Proof of the Existence of a Competitive Price Under the Gross Substitute Property," Keio/Kyoto Joint Global COE Discussion Paper Series 2012-022, Keio/Kyoto Joint Global COE Program.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:37:y:2008:i:2:p:185-201. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.