Iterated elimination procedures
We study the existence and uniqueness (i.e.,order independence) of any arbitrary form of iterated elimination procedures in an abstract environment. By allowing for a transfinite elimination, we show a general existence of the iterated elimination procedure. Inspired by the seminal work of Gilboa, K...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/59233/ |
| _version_ | 1848799598246625280 |
|---|---|
| author | Luo, Xiao Qian, Xuewen Qu, Chen |
| author_facet | Luo, Xiao Qian, Xuewen Qu, Chen |
| author_sort | Luo, Xiao |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | We study the existence and uniqueness (i.e.,order independence) of any arbitrary form of iterated elimination procedures in an abstract environment. By allowing for a transfinite elimination, we show a general existence of the iterated elimination procedure. Inspired by the seminal work of Gilboa, Kalai and Zemel (1990), we identify a fairly weak suffcient condition of Monotonicity* for the order independence of iterated elimination procedure. Monotonicity* requires a monotonicity property along any elimination path. Our approach is applicable to different forms of iterated elimination procedures used in (in)finite games, for example, iterated elimination of strictly dominated strategies, iterated elimination of weakly dominated strategies, rationalizability, and soon. We introduce a notion of CD* games, which incorporates Jackson's (1992) idea of "boundedness", and show the iterated elimination procedure is order independent in the class of CD* games. In finite games, we also formulate and show an "outcome" order-independence result suitable for Marx and Swinkels's (1997) notion of nice weak dominance. |
| first_indexed | 2025-11-14T20:38:12Z |
| format | Article |
| id | nottingham-59233 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T20:38:12Z |
| publishDate | 2019 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-592332019-10-08T00:36:39Z https://eprints.nottingham.ac.uk/59233/ Iterated elimination procedures Luo, Xiao Qian, Xuewen Qu, Chen We study the existence and uniqueness (i.e.,order independence) of any arbitrary form of iterated elimination procedures in an abstract environment. By allowing for a transfinite elimination, we show a general existence of the iterated elimination procedure. Inspired by the seminal work of Gilboa, Kalai and Zemel (1990), we identify a fairly weak suffcient condition of Monotonicity* for the order independence of iterated elimination procedure. Monotonicity* requires a monotonicity property along any elimination path. Our approach is applicable to different forms of iterated elimination procedures used in (in)finite games, for example, iterated elimination of strictly dominated strategies, iterated elimination of weakly dominated strategies, rationalizability, and soon. We introduce a notion of CD* games, which incorporates Jackson's (1992) idea of "boundedness", and show the iterated elimination procedure is order independent in the class of CD* games. In finite games, we also formulate and show an "outcome" order-independence result suitable for Marx and Swinkels's (1997) notion of nice weak dominance. 2019-07-16 Article PeerReviewed application/pdf en cc_by https://eprints.nottingham.ac.uk/59233/1/iterated%20elimination%20procedures.pdf Luo, Xiao, Qian, Xuewen and Qu, Chen (2019) Iterated elimination procedures. Economic Theory . ISSN 0938-2259 Iterated elimination procedures; order independence; Monotonicity*; CD* games; "outcome" order independence http://dx.doi.org/10.1007/s00199-019-01215-6 doi:10.1007/s00199-019-01215-6 doi:10.1007/s00199-019-01215-6 |
| spellingShingle | Iterated elimination procedures; order independence; Monotonicity*; CD* games; "outcome" order independence Luo, Xiao Qian, Xuewen Qu, Chen Iterated elimination procedures |
| title | Iterated elimination procedures |
| title_full | Iterated elimination procedures |
| title_fullStr | Iterated elimination procedures |
| title_full_unstemmed | Iterated elimination procedures |
| title_short | Iterated elimination procedures |
| title_sort | iterated elimination procedures |
| topic | Iterated elimination procedures; order independence; Monotonicity*; CD* games; "outcome" order independence |
| url | https://eprints.nottingham.ac.uk/59233/ https://eprints.nottingham.ac.uk/59233/ https://eprints.nottingham.ac.uk/59233/ |