000 05981nam a22005655i 4500
001 978-3-540-77105-0
003 DE-He213
005 20160624102115.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540771050
_9978-3-540-77105-0
024 7 _a10.1007/978-3-540-77105-0
_2doi
050 4 _aQA76.76.A65
072 7 _aUNH
_2bicssc
072 7 _aUDBD
_2bicssc
072 7 _aCOM032000
_2bisacsh
082 0 4 _a005.7
_223
245 1 0 _aInternet and Network Economics
_h[electronic resource] :
_bThird International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007. Proceedings /
_cedited by Xiaotie Deng, Fan Chung Graham.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2007.
300 _aXVI, 600 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4858
505 0 _aWINE 2007 -- Getting to Economic Equilibrium: A Problem and Its History -- My Favorite Simplicial Complex and Some of Its Applications -- Markets and the Primal-Dual Paradigm -- The Computation of Equilibria -- A Note on Equilibrium Pricing as Convex Optimization -- New Algorithms for Approximate Nash Equilibria in Bimatrix Games -- A Unified Approach to Congestion Games and Two-Sided Markets -- An Optimization Approach for Approximate Nash Equilibria -- Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games -- Bluffing and Strategic Reticence in Prediction Markets -- Pari-Mutuel Markets: Mechanisms and Performance -- Information Sharing Communities -- Competitive Safety Strategies in Position Auctions -- Maintaining Equilibria During Exploration in Sponsored Search Auctions -- Stochastic Models for Budget Optimization in Search-Based Advertising -- Auctions with Revenue Guarantees for Sponsored Search -- Equilibrium Analysis of Dynamic Bidding in Sponsored Search Auctions -- Cooperative or Vindictive: Bidding Strategies in Sponsored Search Auction -- Cost-Balancing Tolls for Atomic Network Congestion Games -- Network Formation: Bilateral Contracting and Myopic Dynamics -- Who Should Pay for Forwarding Packets? -- On the Performance of Congestion Games for Optimum Satisfiability Problems -- Incentive-Compatible Interdomain Routing with Linear Utilities -- Mechanism Design I -- False-Name-Proof Mechanisms for Hiring a Team -- Mechanism Design on Trust Networks -- Stochastic Mechanism Design -- A Note on Maximizing the Spread of Influence in Social Networks -- A Network Creation Game with Nonuniform Interests -- A Theory of Loss-Leaders: Making Money by Pricing Below Cost -- PageRank as a Weak Tournament Solution -- Competitive Influence Maximization in Social Networks -- Advertisement Pricing I -- Sponsored Search with Contexts -- Capacity Constraints and the Inevitability of Mediators in Adword Auctions -- Cost of Conciseness in Sponsored Search Auctions -- Adwords Auctions with Decreasing Valuation Bids -- An Adaptive Sponsored Search Mechanism ?-Gain Truthful in Valuation, Time, and Budget -- Extending Polynomial Time Computability to Markets with Demand Correspondences -- Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities -- Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets -- Computing Market Equilibrium: Beyond Weak Gross Substitutes -- On Competitiveness in Uniform Utility Allocation Markets -- Total Latency in Singleton Congestion Games -- The Importance of Network Topology in Local Contribution Games -- Secure Relative Performance Scheme -- Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem -- The Wi-Fi Roaming Game -- On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games -- The Stable Roommates Problem with Globally-Ranked Pairs -- A PSPACE-complete Sperner Triangle Game -- Group Dominant Strategies -- Weighted Boolean Formula Games -- Core Stability of Vertex Cover Games -- Mechanism Design II -- Maximizing Revenue in Sequential Auctions -- Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems -- To Be or Not to Be (Served) -- Advertisement Pricing II -- Ad Auction Design and User Experience -- Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm -- Empirical Price Modeling for Sponsored Search -- Pay-per-action Model for Online Advertising -- Public Advertisement Broker Markets -- Mechanism Design III -- K-NCC: Stability Against Group Deviations in Non-cooperative Computation -- Monotone Properties of Randomized Symmetric Incentive Compatible Auctions -- Computing Optimal Bundles for Sponsored Search -- On the Price of Truthfulness in Path Auctions -- Characterizing Truthful Market Design.
650 0 _aComputer science.
650 0 _aComputational complexity.
650 0 _aInformation storage and retrieval systems.
650 0 _aInformation systems.
650 0 _aElectronic commerce.
650 1 4 _aComputer Science.
650 2 4 _aInformation Systems Applications (incl.Internet).
650 2 4 _aComputers and Society.
650 2 4 _aComputer Appl. in Administrative Data Processing.
650 2 4 _aElectronic Commerce/e-business.
650 2 4 _aInformation Storage and Retrieval.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aDeng, Xiaotie.
_eeditor.
700 1 _aGraham, Fan Chung.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540771043
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4858
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-77105-0
942 _2EBK7962
_cEBK
999 _c37256
_d37256