| Description |
1 online resource (xi, 325 pages) : illustrations (some color) |
| Series |
Lecture notes in computer science, 0302-9743 ; 6982 |
|
Lecture notes in computer science ; 6982. 0302-9743
|
| Contents |
Machine generated contents note: Invited Talks -- Computational Game Theory / Bruno Codenotti -- Computation and Incentives of Competitive Equilibria in a Matching Market / Xiaotie Deng -- Session 1 Auctions and Advertising -- Repeated Budgeted Second Price Ad Auction / Yishay Mansour -- Prompt Mechanism for Ad Placement over Time / Ety Khaitsin -- Multiple Attribution Problem in Pay-Per-Conversion Advertising / Erik Vee -- On Communication Protocols That Compute Almost Privately / Venkatakumar Srinivasan -- Session 2 Quality of Solutions -- Dynamic Inefficiency: Anarchy without Stability / Mishael Rosenthal -- Throw One's Cake -- and Eat It Too / Yair Dombb -- Price of Optimum in a Matching Game / Jerome Monnot -- Pareto Optimality in Coalition Formation / Paul Harrenstein -- Session 3 Externalities -- Externalities among Advertisers in Sponsored Search / Orestis Telelis -- ̂ Peer Effects and Stability in Matching Markets / Adam Wierman -- Steady Marginality: A Uniform Approach to Shapley Value for Games with Externalities / Oskar Skibski -- Session 4 Mechanism Design -- Scheduling without Payments / Elias Koutsoupias -- Combinatorial Agency of Threshold Functions / David C. Parkes -- Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines / Zhenghui Wang -- Truthful Mechanism for Value-Based Scheduling in Cloud Computing / Jonathan Yaniv -- Session 5 Complexity -- Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof) / Paul G. Spirakis -- Complexity of Rational and Irrational Nash Equilibria / Marios Mavronicolas -- Diffusion in Social Networks with Competing Products / Evangelos Markakis -- Session 6 Network Games -- Clustering Coefficient Network Formation Game / Michael Kearns -- ̂ On the Existence of Pure Strategy Nash Equilibria in Integer-Splittable Weighted Congestion Games / Nicholas R. Jennings |
|
Note continued: On Dynamics in Basic Network Creation Games / Pascal Lenzner -- Session 7 Pricing -- Pricing Exotic Derivatives Using Regret Minimization / Yishay Mansour -- Strategic Pricing in Next-Hop Routing with Elastic Demands / Koushik Kar -- Session 8 Routing Games -- Weakly-Acyclic (Internet) Routing Games / Michael Schapira -- Efficiency of Restricted Tolls in Non-atomic Network Routing Games / Guido Schafer -- Stochastic Selfish Routing / Nicolas E. Stier-Moses |
| Summary |
This book constitutes the refereed proceedings of the Fourth International Symposium on Algorithmic Game Theory, SAGT 2011, held in Amalfi, Italy, in October 2011. The 26 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 65 submissions. The papers are organized in topical sections on auctions and advertising, quality of solutions, externalities, mechanism design, complexity, network games, pricing, as well as routing games |
| Analysis |
Computer science |
|
Electronic data processing |
|
Computer simulation |
|
Simulation and Modeling |
|
e-Commerce/e-business |
|
Models and Principles |
|
Computers and Society |
|
Numeric Computing |
|
Probability and Statistics in Computer Science |
| Bibliography |
Includes bibliographical references and index |
| Subject |
Game theory -- Congresses
|
|
Algorithms -- Congresses
|
|
Informatique.
|
|
Algorithms
|
|
Game theory
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Persiano, Giuseppe.
|
| ISBN |
9783642248290 |
|
3642248292 |
|
3642248284 |
|
9783642248283 |
|
