Truth Revelation in Rapid, Approximately Efficient Combinatorial Auctions PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Truth Revelation in Rapid, Approximately Efficient Combinatorial Auctions PDF full book. Access full book title Truth Revelation in Rapid, Approximately Efficient Combinatorial Auctions by . Download full books in PDF and EPUB format.
Author:
Publisher:
ISBN:
Category : Game theory
Languages : en
Pages :
Get Book Here
Book Description
"Some important classical mechanisms considered in Microeconomics and Game Theory require the solution of a difficult optimization problem. This is true of mechanisms for combinatorial auctions, which have in recent years assumed practical importance, and in particular of the gold standard for combinatorial auctions, the Generalized Vickrey Auction (GVA). Traditional analysis of these mechanisms - in particular, their truth revelation properties - assumes that the optimization problems are solved precisely. In reality, these optimization problems can usually be solved only in an approximate fashion. We investigate the impact on such mechanisms of replacing exact solutions by approximate ones. Specifically, we look at a particular greedy optimization method, which has empirically been shown to perform well. We show that the GVA payment scheme does not provide for a truth revealing mechanism. We introduce another scheme that does guarantee truthfulness for a restricted class of players. We demonstrate the latter property by identifying sufficient conditions for a combinatorial auction to be truth-revealing, conditions which have applicability beyond the specific auction studied here."--Abstract.
Author:
Publisher:
ISBN:
Category : Game theory
Languages : en
Pages :
Get Book Here
Book Description
"Some important classical mechanisms considered in Microeconomics and Game Theory require the solution of a difficult optimization problem. This is true of mechanisms for combinatorial auctions, which have in recent years assumed practical importance, and in particular of the gold standard for combinatorial auctions, the Generalized Vickrey Auction (GVA). Traditional analysis of these mechanisms - in particular, their truth revelation properties - assumes that the optimization problems are solved precisely. In reality, these optimization problems can usually be solved only in an approximate fashion. We investigate the impact on such mechanisms of replacing exact solutions by approximate ones. Specifically, we look at a particular greedy optimization method, which has empirically been shown to perform well. We show that the GVA payment scheme does not provide for a truth revealing mechanism. We introduce another scheme that does guarantee truthfulness for a restricted class of players. We demonstrate the latter property by identifying sufficient conditions for a combinatorial auction to be truth-revealing, conditions which have applicability beyond the specific auction studied here."--Abstract.
Author: Sotiris E. Nikoletseas
Publisher: Springer
ISBN: 3540320784
Category : Computers
Languages : en
Pages : 637
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, WEA 2005, held in Santorini Island, Greece in May 2005. The 47 revised full papers and 7 revised short papers presented together with extended abstracts of 3 invited talks were carefully reviewed and selected from 176 submissions. The book is devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, scheduling, searching, sorting, string matching, coding, networking, data mining, data analysis, etc.
Author: D.T. Lee
Publisher: Springer Science & Business Media
ISBN: 3540412557
Category : Computers
Languages : en
Pages : 592
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 11th International Conference on Algorithms and Computation, ISAAC 2000, held in Taipei, Taiwan in December 2000. The 46 revised papers presented together with an invited paper were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on algorithms and data structures; combinatorial optimization; approximation and randomized algorithms; graph drawing and graph algorithms; automata, cryptography, and complexity theory; parallel and distributed algorithms; computational geometry; and computational biology.
Author: Martin Charles Golumbic
Publisher: Springer Science & Business Media
ISBN: 0387250360
Category : Mathematics
Languages : en
Pages : 296
Get Book Here
Book Description
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by experts in their respective fields, and covers a wide spectrum of high-interest problems across these discipline domains. Among the contributing authors are Richard Karp of UC Berkeley and Robert Tarjan of Princeton; both are at the pinnacle of research scholarship in Graph Theory and Combinatorics. The chapters from the contributing authors focus on "real world" applications, all of which will be of considerable interest across the areas of Operations Research, Computer Science, Applied Mathematics, and Engineering. These problems include Internet congestion control, high-speed communication networks, multi-object auctions, resource allocation, software testing, data structures, etc. In sum, this is a book focused on major, contemporary problems, written by the top research scholars in the field, using cutting-edge mathematical and computational techniques.
Author: Giuseppe Di Battista
Publisher: Springer
ISBN: 3540396586
Category : Computers
Languages : en
Pages : 810
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 11th Annual European Symposium on Algorithms, ESA 2003, held in Budapest, Hungary, in September 2003. The 66 revised full papers presented were carefully reviewed and selected from 165 submissions. The scope of the papers spans the entire range of algorithmics from design and mathematical analysis issues to real-world applications, engineering, and experimental analysis of algorithms.
Author: Helmut Alt
Publisher: Springer Science & Business Media
ISBN: 3540006230
Category : Computers
Languages : en
Pages : 716
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2003, held in Berlin, Germany in February/March 2003. The 58 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 253 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, logic in computer science, as well as current challenges like biological computing, quantum computing, and mobile and net computing.
Author: Hannes Werthner
Publisher: Springer Science & Business Media
ISBN: 9783211836231
Category : Computers
Languages : en
Pages : 236
Get Book Here
Book Description
Although only a few years old, electronic commerce offers new ways of doing business that no business can afford to ignore. This book is a collection of selected contributions from renowned researchers who specialize in the various facets of electronic commerce, namely economics, finance, information technology, and education. The basic goal is to give an overview of some of the most relevant topics in E-Commerce.
Author:
Publisher:
ISBN:
Category : Artificial intelligence
Languages : en
Pages : 1712
Get Book Here
Book Description
Author: Vaclav Hlavac
Publisher: Springer Science & Business Media
ISBN: 3540413480
Category : Computers
Languages : en
Pages : 470
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2000, held in Milovy, Czech Republic in November/December 2000. The 16 invited papers and 18 contributed papers selected from 36 submissions were carefully selected in order to provide representative coverage of the three tracks: trends in algorithms, information technologies and practice, and computational perception.
Author: Kagan Tumer
Publisher: Springer Science & Business Media
ISBN: 1441989099
Category : Mathematics
Languages : en
Pages : 329
Get Book Here
Book Description
Many complex systems found in nature can be viewed as function optimizers. In particular, they can be viewed as such optimizers of functions in extremely high dimensional spaces. Given the difficulty of performing such high-dimensional op timization with modern computers, there has been a lot of exploration of computa tional algorithms that try to emulate those naturally-occurring function optimizers. Examples include simulated annealing (SA [15,18]), genetic algorithms (GAs) and evolutionary computation [2,3,9,11,20-22,24,28]. The ultimate goal of this work is an algorithm that can, for any provided high-dimensional function, come close to extremizing that function. Particularly desirable would be such an algorithm that works in an adaptive and robust manner, without any explicit knowledge of the form of the function being optimized. In particular, such an algorithm could be used for distributed adaptive control---one of the most important tasks engineers will face in the future, when the systems they design will be massively distributed and horribly messy congeries ofcomputational systems.
