EDBT 2026 Demo / reviewers in the wild / expert
Evan Piermont
dblp:191/7161
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0002-4189-5504ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 since 2021Theory of computation · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
3 papers |
Knowledge representation and reasoning · 64% Probabilistic and Bayesian machine learning · 23% Efficient and distributed learning · 13% | |
| Theoretical computer science
2 papers |
Algorithmic game theory and mechanism design · 81% Logic in computer science · 19% |
Topics — the 8 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal model |
0.8 | 1 | 2024 | A Representation Theorem for Causal Decision Making · KR 2024 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
causal reasoning |
0.8 | 1 | 2024 | A Representation Theorem for Causal Decision Making · KR 2024 |
Algorithmic game theory and mechanism design
decision theory |
0.8 | 1 | 2024 | A Representation Theorem for Causal Decision Making · KR 2024 |
Algorithmic game theory and mechanism design › social choice › computational social choice
preference representation |
0.8 | 1 | 2024 | A Representation Theorem for Causal Decision Making · KR 2024 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
belief revision |
0.4 | 1 | 2020 | Dynamic Awareness · KR 2020 |
Machine learning › Efficient and distributed learning › model deployment
model migration |
0.4 | 1 | 2020 | Dynamic Awareness · KR 2020 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
reasoning about knowledge and belief |
0.4 | 1 | 2020 | Dynamic Awareness · KR 2020 |
Logic in computer science
modal logic |
0.4 | 1 | 2019 | Partial Awareness · AAAI 2019 |
Methods — techniques the papers use, named apart from their topics
representation theorem · 1.5expected utility · 1.5modal logic · 0.8probabilistic epistemic logic · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | A Representation Theorem for Causal Decision MakingabstractWe show that it is possible to understand and identify a decision maker’s subjective causal judgements by observing her preferences over interventions. Following Pearl [2000, DOI: doi.org/10.1017/S0266466603004109 ], we represent causality using causal models (also called structural equations models), where the world is described by a collection of variables, related by equations. We show that if a preference relation over interventions satisfies certain axioms (related to standard axioms regarding counterfactuals), then we can define (i) a causal model, (ii) a probability capturing the decision-maker’s uncertainty regarding the external factors in the world and (iii) a utility on outcomes such that each intervention is associated with an expected utility and such that intervention A is preferred to B iff the expected utility of A is greater than that of B. In addition, we characterize when the causal model is unique. Thus, our results allow a modeler to test the hypothesis that a decision maker’s preferences are consistent with some causal model and to identify causal judgements from observed behavior. Joseph Y. Halpern, Evan Piermont |
KR | 2 |
| 2020 | Dynamic AwarenessabstractWe investigate how to model the beliefs of an agent who becomes more aware. We use the framework of Halpern and Rego (2013) by adding probability, and define a notion of a model transition that describes constraints on how, if an agent becomes aware of a new formula φ in state s of a model M, she transitions to state s* in a model M*. We then discuss how such a model can be applied to information disclosure. Joseph Y. Halpern, Evan Piermont |
KR | 2 |
| 2019 | Partial AwarenessabstractWe develop a modal logic to capture partial awareness. The logic has three building blocks: objects, properties, and concepts. Properties are unary predicates on objects; concepts are Boolean combinations of properties. We take an agent to be partially aware of a concept if she is aware of the concept without being aware of the properties that define it. The logic allows for quantification over objects and properties, so that the agent can reason about her own unawareness. We then apply the logic to contracts, which we view as syntactic objects that dictate outcomes based on the truth of formulas. We show that when agents are unaware of some relevant properties, referencing concepts that agents are only partially aware of can improve welfare. Joseph Y. Halpern, Evan Piermont |
AAAI | 2 |