2.2k citations
- California Institute of TechnologyUS17 papers
- University of California, BerkeleyUS10 papers
- University of OxfordGB9 papers
- Centre National de la Recherche ScientifiqueFR8 papers
- University of ChicagoUS8 papers
- University of FloridaUS8 papers
- Jet Propulsion LaboratoryUS7 papers
- University of California San DiegoUS7 papers
- Brookhaven National LaboratoryUS6 papers
- Lawrence Berkeley National LaboratoryUS6 papers
- National Radio Astronomy ObservatoryUS6 papers
- University of CambridgeGB6 papers
Showing 2009 · cs.AIShow all
2 papers · 2 filters
cs.AI2009★ 2 cited
A Logical Characterization of Iterated Admissibility
Joseph Y. Halpern, Rafael Pass
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty i…
cs.AI2009★ 78 cited
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Carmel Domshlak, Francesca Rossi, Kristen Brent Venable +1
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all th…