License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.05011.1
URN: urn:nbn:de:0030-drops-2250
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2005/225/
|
Go to the corresponding Portal |
Lehmann, Daniel ;
Müller, Rudolf ;
Sandholm, Tuomas
05011 Abstracts Collection -- Computing and Markets
Abstract
From 03.01.05 to 07.01.05, the
Dagstuhl Seminar 05011``Computing and Markets'' was held
in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
BibTeX - Entry
@InProceedings{lehmann_et_al:DagSemProc.05011.1,
author = {Lehmann, Daniel and M\"{u}ller, Rudolf and Sandholm, Tuomas},
title = {{05011 Abstracts Collection – Computing and Markets}},
booktitle = {Computing and Markets},
pages = {1--26},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5011},
editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2005/225},
URN = {urn:nbn:de:0030-drops-2250},
doi = {10.4230/DagSemProc.05011.1},
annote = {Keywords: Algorithms, complexity, game theory, social choice, auctions, equilibrium}
}
|
Keywords: |
|
Algorithms, complexity, game theory, social choice, auctions, equilibrium |
|
Collection: |
|
05011 - Computing and Markets |
|
Issue Date: |
|
2005 |
|
Date of publication: |
|
28.07.2005 |
