Internet and Network Economics: Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007. Proceedings

Free Download

Authors:

Edition: 1

Series: Lecture Notes in Computer Science 4858

ISBN: 3540771042, 9783540771043

Size: 6 MB (5807015 bytes)

Pages: 600/611

File format:

Language:

Publishing Year:

Category: Tags: , , , , ,

Kenneth J. Arrow (auth.), Xiaotie Deng, Fan Chung Graham (eds.)3540771042, 9783540771043


Table of contents :
Front Matter….Pages –
Competitive Safety Strategies in Position Auctions….Pages 108-118
Maintaining Equilibria During Exploration in Sponsored Search Auctions….Pages 119-130
Stochastic Models for Budget Optimization in Search-Based Advertising….Pages 131-142
Auctions with Revenue Guarantees for Sponsored Search….Pages 143-154
Equilibrium Analysis of Dynamic Bidding in Sponsored Search Auctions….Pages 155-166
Cooperative or Vindictive: Bidding Strategies in Sponsored Search Auction….Pages 167-178
Cost-Balancing Tolls for Atomic Network Congestion Games….Pages 179-190
Network Formation: Bilateral Contracting and Myopic Dynamics….Pages 191-207
Getting to Economic Equilibrium: A Problem and Its History….Pages 1-2
My Favorite Simplicial Complex and Some of Its Applications….Pages 3-3
Markets and the Primal-Dual Paradigm….Pages 4-4
The Computation of Equilibria….Pages 5-6
A Note on Equilibrium Pricing as Convex Optimization….Pages 7-16
New Algorithms for Approximate Nash Equilibria in Bimatrix Games….Pages 17-29
A Unified Approach to Congestion Games and Two-Sided Markets….Pages 30-41
An Optimization Approach for Approximate Nash Equilibria….Pages 42-56
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games….Pages 57-69
Bluffing and Strategic Reticence in Prediction Markets….Pages 70-81
Pari-Mutuel Markets: Mechanisms and Performance….Pages 82-95
Information Sharing Communities….Pages 96-107
Who Should Pay for Forwarding Packets?….Pages 208-219
On the Performance of Congestion Games for Optimum Satisfiability Problems….Pages 220-231
Incentive-Compatible Interdomain Routing with Linear Utilities….Pages 232-244
False-Name-Proof Mechanisms for Hiring a Team….Pages 245-256
Mechanism Design on Trust Networks….Pages 257-268
Stochastic Mechanism Design….Pages 269-280
A Note on Maximizing the Spread of Influence in Social Networks….Pages 281-286
A Network Creation Game with Nonuniform Interests….Pages 287-292
A Theory of Loss-Leaders: Making Money by Pricing Below Cost….Pages 293-299
PageRank as a Weak Tournament Solution….Pages 300-305
Competitive Influence Maximization in Social Networks….Pages 306-311
Sponsored Search with Contexts….Pages 312-317
Capacity Constraints and the Inevitability of Mediators in Adword Auctions….Pages 318-325
Cost of Conciseness in Sponsored Search Auctions….Pages 326-334
Adwords Auctions with Decreasing Valuation Bids….Pages 335-340
An Adaptive Sponsored Search Mechanism δ -Gain Truthful in Valuation, Time, and Budget….Pages 341-346
Extending Polynomial Time Computability to Markets with Demand Correspondences….Pages 347-355
Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities….Pages 356-361
Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets….Pages 362-367
Computing Market Equilibrium: Beyond Weak Gross Substitutes….Pages 368-373
On Competitiveness in Uniform Utility Allocation Markets….Pages 374-380
Total Latency in Singleton Congestion Games….Pages 381-387
The Importance of Network Topology in Local Contribution Games….Pages 388-395
Secure Relative Performance Scheme….Pages 396-403
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem….Pages 404-411
The Wi-Fi Roaming Game….Pages 412-418
On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games….Pages 419-430
The Stable Roommates Problem with Globally-Ranked Pairs….Pages 431-444
A PSPACE-complete Sperner Triangle Game….Pages 445-456
Group Dominant Strategies….Pages 457-468
Weighted Boolean Formula Games….Pages 469-481
Core Stability of Vertex Cover Games….Pages 482-490
Maximizing Revenue in Sequential Auctions….Pages 491-502
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems….Pages 503-514
To Be or Not to Be (Served)….Pages 515-528
Ad Auction Design and User Experience….Pages 529-534
Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm….Pages 535-540
Empirical Price Modeling for Sponsored Search….Pages 541-548
Pay-per-action Model for Online Advertising….Pages 549-557
Public Advertisement Broker Markets….Pages 558-563
K-NCC: Stability Against Group Deviations in Non-cooperative Computation….Pages 564-569
Monotone Properties of Randomized Symmetric Incentive Compatible Auctions….Pages 570-575
Computing Optimal Bundles for Sponsored Search….Pages 576-583
On the Price of Truthfulness in Path Auctions….Pages 584-589
Characterizing Truthful Market Design….Pages 590-595
Back Matter….Pages –

Reviews

There are no reviews yet.

Be the first to review “Internet and Network Economics: Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007. Proceedings”
Shopping Cart
Scroll to Top