IDEAS home Printed from https://ideas.repec.org/a/kap/theord/v65y2008i1p27-44.html
   My bibliography  Save this article

Binary Relations: Finite Characterizations and Computational Complexity

Author

Listed:
  • Vicki Knoblauch

Abstract

No abstract is available for this item.

Suggested Citation

  • Vicki Knoblauch, 2008. "Binary Relations: Finite Characterizations and Computational Complexity," Theory and Decision, Springer, vol. 65(1), pages 27-44, August.
    • Handle: RePEc:kap:theord:v:65:y:2008:i:1:p:27-44
    DOI: 10.1007/s11238-007-9079-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11238-007-9079-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11238-007-9079-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Vicki Knoblauch, 2005. "Characterizing Paretian preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 25(1), pages 179-186, October.
    2. Sprumont, Yves, 2001. "Paretian Quasi-orders: The Regular Two-Agent Case," Journal of Economic Theory, Elsevier, vol. 101(2), pages 437-456, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vicki Knoblauch, 2005. "Finite Characterizations and Paretian Preferences," Working papers 2005-02, University of Connecticut, Department of Economics.
    2. Thomas Demuynck, 2014. "The computational complexity of rationalizing Pareto optimal choice behavior," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 529-549, March.
    3. BOSSERT, Walter & SUZUMURA, Kotaro, 2006. "Non-Deteriorating Choice without Full Transitivity," Cahiers de recherche 10-2006, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    4. Shaofang Qi, 2016. "A characterization of the n-agent Pareto dominance relation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(3), pages 695-706, March.
    5. Carvajal, Andres & Ray, Indrajit & Snyder, Susan, 2004. "Equilibrium behavior in markets and games: testable restrictions and identification," Journal of Mathematical Economics, Elsevier, vol. 40(1-2), pages 1-40, February.
    6. Voorneveld, Mark, 2002. "Characterization of Pareto Dominance," SSE/EFI Working Paper Series in Economics and Finance 487, Stockholm School of Economics.
    7. Ray, Indrajit & Snyder, Susan, 2013. "Observable implications of Nash and subgame-perfect behavior in extensive games," Journal of Mathematical Economics, Elsevier, vol. 49(6), pages 471-477.
    8. Pivato, Marcus, 2013. "Multiutility representations for incomplete difference preorders," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 196-220.
    9. Echenique, Federico & Ivanov, Lozan, 2011. "Implications of Pareto efficiency for two-agent (household) choice," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 129-136, March.
    10. Chambers, Christopher P. & Echenique, Federico & Shmaya, Eran, 2017. "General revealed preference theory," Theoretical Economics, Econometric Society, vol. 12(2), May.
    11. Demuynck, Thomas, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.
    12. Kaminski, B., 2007. "On quasi-orderings and multi-objective functions," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1591-1598, March.
    13. T. Demuynck, 2006. "Existence of closed and complete extensions applied to convex, homothetic an monotonic orderings," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/407, Ghent University, Faculty of Economics and Business Administration.
    14. Vicki Knoblauch, 2003. "Continuous Paretian Preferences," Working papers 2003-29, University of Connecticut, Department of Economics.
    15. Bossert, Walter & Sprumont, Yves, 2003. "Efficient and non-deteriorating choice," Mathematical Social Sciences, Elsevier, vol. 45(2), pages 131-142, April.
    16. Vicki Knoblauch, 2005. "Characterizing Paretian preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 25(1), pages 179-186, October.
    17. Vicki Knoblauch, 2009. "Topologies Defined by Binary Relations," Working papers 2009-28, University of Connecticut, Department of Economics, revised Dec 2009.
    18. Candeal, Juan C., 2022. "Bi-utility representable orderings on a countable set," Economics Letters, Elsevier, vol. 217(C).
    19. Ray, Indrajit & Snyder, Susan, 2013. "Observable implications of Nash and subgame-perfect behavior in extensive games," Journal of Mathematical Economics, Elsevier, vol. 49(6), pages 471-477.
    20. Jerry S. Kelly & Shaofang Qi, 2016. "A conjecture on the construction of orderings by Borda’s rule," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(1), pages 113-125, June.

    More about this item

    Keywords

    preferences; Pareto order; voting; D11; D70;
    All these keywords.

    JEL classification:

    • D11 - Microeconomics - - Household Behavior - - - Consumer Economics: Theory
    • D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:theord:v:65:y:2008:i:1:p:27-44. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.