Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Pierfrancesco La Mura

dblp:91/5955 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
0since 2021 · last 2009
0000-0001-6130-2166ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 3 first-authorArtificial intelligence and machine learning · 3 · 2 first-author

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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › mechanism design
bilateral trade
0.012004
Negotiation-range mechanisms: exploring the limits of truthful efficient markets · EC 2004
Algorithmic game theory and mechanism design › market design
market mechanism
0.012004
Negotiation-range mechanisms: exploring the limits of truthful efficient markets · EC 2004

Methods — techniques the papers use, named apart from their topics

incentive compatibility · 0.0efficiency analysis · 0.0budget balance · 0.0
YearPublicationVenuePosition
2009 Projective expected utility: a subjective formulation
abstract
Motivated by classical decision-theoretic paradoxes (Allais 1953, Ellsberg 1961), we introduce a projective generalization of expected utility along the lines of the quantum-mechanical generalization of probability theory. The resulting decision theory accommodates the paradoxes, while retaining significant simplicity and tractability. In particular, every finite game within this larger class of preferences still has an equilibrium.
Pierfrancesco La Mura
TARK1
2004 Negotiation-range mechanisms: exploring the limits of truthful efficient markets
abstract
This paper introduces a new class of mechanisms based on negotiation between market participants. This model allows us to circumvent Myerson and Satterthwaite's impossibility result and present a bilateral market mechanism that is efficient, individually rational, incentive compatible, and budget balanced in the single-unit heterogeneous setting. The underlying scheme makes this combination of desirable qualities possible by reporting a price range for each buyer-seller pair that defines a zone of possible agreements, while the final price is left open for negotiation.
Yair Bartal, Rica Gonen, Pierfrancesco La Mura
EC3
2003 Decision-theoretic entropy
abstract
We introduce an axiomatic approach to the problem of inferring a complete and transitive weak ordering representing the agent's preferences given a set of observed constraints. The axioms characterize a unique inference rule, which amounts to the constrained maximization of a certain formula we derive. The formula can be interpreted as the entropy of the agent's preference ordering, and its unique maximand identifies the simplest rationalization of the observed behavior.
Pierfrancesco La Mura
TARK1
2000 Game Networks
Pierfrancesco La Mura
UAI1
1999 Expected Utility Networks
Pierfrancesco La Mura, Yoav Shoham
UAI1
1998 Conditional, Hierarchical, Multi-Agent Preferences
Pierfrancesco La Mura, Yoav Shoham
TARK1