activity
20092023
most citedArtificial Intelligence and Life in 2030: The One Hundred Year Study on Artificial Intelligence

153 citations · 816 across the 54 of their papers we have counts for

collaborators
Showing 2012 · cs.GTShow all

5 papers · 2 filters

cs.GT2012★ 1 cited

Payment Rules through Discriminant-Based Classifiers

Paul Duetting, Felix Fischer, Pitchayut Jirapinyo +3

In mechanism design it is typical to impose incentive compatibility and then derive an optimal mechanism subject to this constraint. By replacing the incentive compatibility requir…

cs.GT2012★ 39 cited

Models for Truthful Online Double Auctions

Jonathan Bredin, David C. Parkes

Online double auctions (DAs) model a dynamic two-sided matching problem with private information and self-interest, and are relevant for dynamic resource and task allocation proble…

cs.GT2012★ 42 cited

Optimal Coordinated Planning Amongst Self-Interested Agents with Private State

Ruggiero Cavallo, David C. Parkes, Satinder Singh

Consider a multi-agent system in a dynamic and uncertain environment. Each agent's local decision problem is modeled as a Markov decision process (MDP) and agents must coordinate o…

cs.GT2012★ 14 cited

Learning and Solving Many-Player Games through a Cluster-Based Representation

Sevan G. Ficici, David C. Parkes, Avi Pfeffer

In addressing the challenge of exponential scaling with the number of agents we adopt a cluster-based representation to approximately solve asymmetric games of very many players. A…

cs.GT2012★ 18 cited

Quantifying the Strategyproofness of Mechanisms via Metrics on Payoff Distributions

Benjamin Lubin, David C. Parkes

Strategyproof mechanisms provide robust equilibrium with minimal assumptions about knowledge and rationality but can be unachievable in combination with other desirable properties…