DISTRIBUTED ALGORITHMIC MECHANISM DESIGN: RECENT RESULTS AND FUTURE DIRECTIONS

Joan Feigenbaum A · Scott Shenker

51 citations0/0 files storedWORLD SCIENTIFIC eBooks

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Game Theory and Applications Game Theory and Voting Systems Auction Theory and Applications

Abstract

Distributed Algorithmic Mechanism Design (DAMD) combines theoretical computer science's traditional focus on computational tractability with its more recent interest in incentive compatibility and distributed computing. The Internet's decentralized nature, in which distributed computation and autonomous agents prevail, makes DAMD a very natural approach for many Internet problems. This paper first outlines the basics of DAMD and then reviews previous DAMD results on multicast cost sharing and interdomain routing. The remainder of the paper describes several promising research directions and poses some specific open problems.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 51 citations exist upstream.

Cited by

2003Approximation and collusion in multicast cost sharing 2005Editorial: The Future of Power Law Research 2004Approximately-strategyproof and tractable multiunit auctions 2004Near rationality and competitive equilibria in networked systems 2006Resource Allocation Among Agents with MDP-Induced Preferences 2024On the computational complexity of ethics: moral tractability for minds and machines

Imported from OpenAlex (CC0) — nothing here is generated.