## Internet and Network Economics: Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, ProceedingsThis book constitutes the refereed proceedings of the Second International Workshop on Internet and Network Economics, WINE 2006, held in Patras, Greece in December 2006. It contains 32 papers that contain foundational and mathematical work for solving problems in internet technologies, grid computing, network communication protocols, as well as social economic issues in virtual communities enabled through the World Wide Web. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Recent Developments in Learning and Competition with Finite Automata Extended Abstract | 1 |

Dynamic Mechanism Design | 3 |

Unconditional Competitive Auctions with Copy and Budget Constraints | 16 |

Truthful Auctions with Optimal Proﬁt | 27 |

Mechanisms with Veriﬁcation for Any Finite Domain | 37 |

Pure Nash Equilibria in PlayerSpeciﬁc and Weighted Congestion Games | 50 |

On the Complexity of PureStrategy Nash Equilibria in Congestion and LocalEffect Games Extended Abstract | 62 |

Strong and Correlated Strong Equilibria in Monotone Congestion Games | 74 |

Model and Algorithm Based on Copulas | 214 |

An Approximation Scheme for Computing the Market Equilibrium | 225 |

New Results on Rationality and Strongly Polynomial Time Solvability in EisenbergGale Markets | 239 |

Making Economic Theory Operational | 251 |

Sparse Games Are Hard | 262 |

Market Equilibria with Hybrid LinearLeontief Utilities | 274 |

Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games | 286 |

A Note on Approximate Nash Equilibria | 297 |

The Equilibrium Existence Problem in Finite Network Congestion Games | 87 |

FirstPassage Percolation on a Width2 Strip and the Path Cost in a VCG Auction | 99 |

Optimal CostSharing Mechanisms for Steiner Forest Problems | 112 |

Mechanisms to Induce Random Choice | 124 |

Bayesian Optimal NoDeﬁcit Mechanism Design | 136 |

Succinct Approximation of TradeOff Curves | 149 |

GameTheoretic Aspects of Designing Hyperlink Structures | 150 |

The Quasilinear Case | 162 |

Selﬁsh Service Installation in Networks Extended Abstract | 174 |

Games of Connectivity | 186 |

Assignment Problems in Rental Markets | 198 |

Ranking Sports Teams and the Inverse Equal Paths Problem | 307 |

Price of Anarchy for Polynomial Wardrop Games | 319 |

Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Trafﬁc | 331 |

A Worm Propagation Model Based on Peoples Email Acquaintance Proﬁles | 343 |

Mixed Strategies in Combinatorial Agency Extended Abstract | 353 |

The Sound of Silence Mining Implicit Feedbacks to Compute Reputation | 365 |

Strongly PolynomialTime Truthful Mechanisms in One Shot | 377 |

Secretary Problems with Competing Employers | 389 |

401 | |

### Other editions - View all

### Common terms and phrases

agents algorithm allocation approximation approximation algorithm assume auction best response bidders bimatrix game bottleneck games buyers Christos Papadimitriou column player combinatorial competitive ratio complexity Computer Science congestion games consider constraint copula cost functions default deﬁned Deﬁnition denote diﬀerent distribution edge eﬀect eﬃcient eﬀort exists ﬁnd ﬁnding ﬁnite ﬁrms ﬁrst ﬁxed ﬂow given hypernode implicit feedbacks incentive compatible input latency functions Lemma linear local-eﬀect market equilibrium matroid maximize mixed strategy monotone Nash equilibrium network congestion network congestion game nodes NP-hard oﬀer optimal Papadimitriou paper path payment payoﬀ player-specific polynomial price of anarchy price of stability probability problem proﬁle proﬁt proof random ranking reputation system row player Section selﬁsh social choice function solution speciﬁc Spirakis subset supermodular Symposium Theorem trafﬁc tree truthful mechanism upper bound users utility functions valuation variables vector veriﬁcation vertex vertices Wardrop equilibrium weighted