| The LNCS series reports state-of-the-art results in computer science research,development,and education,at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community,with numerous individuals,as well as with prestigious organizations and societies,LNCS has grown into the most comprehensive computer science resarch forum available. The scope of LNCS,including its subseries LNAI,spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material publised traditionally includes. -proceedings(published in time for the respective conference) -post-proceedings(consisting of thoroughly revised final full papers) -research monographs(which may be basde on outstanding PhD work,research projects,technical reports,etc.). |
| Truthful Auctions with Optimal Profit Mechanisms with Verification for Any Finite Domain Pure Nash Equilibria in Player-Specific and Weighted Congestion Games On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games Strong and Correlated Strong Equilibria in Monotone Congestion Games The Equilibrium Existence Problem in Finite Network Congestion Games First-Passage Percolation on a Width-2 Strip and the Path Costin a VCG Auction Optimal Cost-Sharing Mechanisms for Steiner Forest Problems Mechanisms to Induce Random Choice Bayesian Optimal No-Deficit Mechanism Design Succinct Approximation of Trade-Off Curves Game-Theoretic Aspects of Designing Hyperlink Structures Competing for Customers in a Social Network: The Quasi-linear Case Selfish Service Installation in Networks Games of Connectivity Assignment Problems in Rental Markets On Portfolio's Default-Risk-Adjusted Duration and Value: Model and Algorithm Based on Copulas Price Roll-Backs and Path Auctions: An Approximation Scheme for Computing the Market Equilibrium New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets Making Economic Theory Operational Sparse Games Are Hard Market Equilibria with Hybrid Linear-Leontief Utilities Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games A Note on Approximate Nash Equilibria Ranking Sports Teams and the Inverse Equal Paths Problem …… Author INdex |
内容加载中，请稍后...
商品评论（0条）