Mechanism design for dynamic environments: online double auctions

Authors:
Dengji Zhao
Affiliations:
Intelligent Systems Lab University of Western Sydney, Australia and IRIT, University of Toulouse, France
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Year:
2011

Citing 6
Cited 0

An optimal algorithm for on-line bipartite matching

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A multiple-choice secretary algorithm with applications to online auctions

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Online algorithms for market clearing

Journal of the ACM (JACM)
Efficient metadeliberation auctions

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Chain: a dynamic double auction framework for matching patient agents

Journal of Artificial Intelligence Research
Mechanism design for double auctions with temporal constraints

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper states the challenges of mechanism design for dynamic environments, especially dynamic double auctions. After a brief review of related work, we specify the problem we are tackling, and then briefly outline our research plan, the results we have achieved to date, and the ongoing directions.