Muutke küpsiste eelistusi

E-raamat: Algorithmic Game Theory: 8th International Symposium, SAGT 2015, Saarbrucken, Germany, September 28-30, 2015. Proceedings

Edited by
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Computer Science 9347
  • Ilmumisaeg: 24-Sep-2015
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Keel: eng
  • ISBN-13: 9783662484333
  • Formaat - PDF+DRM
  • Hind: 49,39 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Computer Science 9347
  • Ilmumisaeg: 24-Sep-2015
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Keel: eng
  • ISBN-13: 9783662484333

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book constitutes the refereed proceedings of the 8th International Symposium on Algorithmic Game Theory, SAGT 2015, held in Saarbrücken, Germany, in September 2015.The 22 full papers presented together with one extended abstract and 6 brief announcements were carefully reviewed and selected from 63 submissions. They cover various important aspects of algorithmic game theory, such as matching under preferences; cost sharing; mechanism design and social choice; auctions; networking; routing and fairness; and equilibrium computation.

Matching under preferences.- Cost sharing.- Mechanism design and social choice.- Auctions.- Networking.- Routing and fairness.- Equilibrium computation.
Matching Under Preferences
Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints
3(12)
Naoyuki Kamiyama
Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability
15(12)
Agnes Cseh
David F. Manlove
Pareto Optimal Matchings in Many-to-Many Markets with Ties
27(16)
Katarina Cechlarova
Pavlos Eirinakis
Tamas Fleiner
Dimitrios Magos
David F. Manlove
Ioannis Mourtos
Eva Ocelakova
Baharak Rastegari
Cost Sharing
Cost-Sharing Models in Participatory Sensing
43(14)
Georgios Birmpas
Costas Courcoubetis
Ioannis Giotis
Evangelos Markakis
Further Results on Capacitated Network Design Games
57(12)
Thomas Erlebach
Matthew Radoja
Cost-Sharing Scheduling Games on Restricted Unrelated Machines
69(16)
Guy Avni
Tami Tamir
Mechanism Design and Social Choice
Efficient Money Burning in General Domains
85(13)
Dimitris Fotakis
Dimitris Tsipras
Christos Tzamos
Emmanouil Zampetakis
Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design
98(12)
Khaled Elbassioni
Kurt Mehlhorn
Fahimeh Ramezani
Equilibria of Plurality Voting: Lazy and Truth-Biased Voters
110(15)
Edith Elkind
Evangelos Markakis
Svetlana Obraztsova
Piotr Skowron
Auctions
The Combinatorial World (of Auctions) According to GARP
125(12)
Shant Boodaghians
Adrian Vetta
Auction Design with a Revenue Target
137(13)
Paul W. Goldberg
Bo Tang
Algorithmic Signaling of Features in Auction Design
150(15)
Shaddin Dughmi
Nicole Immorlica
Ryan O'Donnell
Li-Yang Tan
Networking
On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
165(13)
George Christodoulou
Alkmini Sgouritsa
Bo Tang
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
178(12)
Maximilian Drees
Matthias Feldotto
Soren Riechers
Alexander Skopalik
Can Bandwidth Sharing Be Truthful?
190(13)
Yukun Cheng
Xiaotie Deng
Yifan Pi
Xiang Yan
The Web Graph as an Equilibrium
203(16)
Georgios Kouroupas
Evangelos Markakis
Christos Papadimitriou
Vasileios Rigas
Martha Sideri
Routing and Fairness
Excluding Braess's Paradox in Nonatomic Selfish Routing
219(12)
Xujin Chen
Zhuo Diao
Xiaodong Hu
"Beat-Your-Rival" Routing Games
231(13)
Gideon Blocq
Ariel Orda
Characterization and Computation of Equilibria for Indivisible Goods
244(15)
Simina Branzei
Hadi Hosseini
Peter Bro Miltersen
Equilibrium Computation
When Can Limited Randomness Be Used in Repeated Games?
259(13)
Pavel Hubacek
Moni Naor
Jonathan Ullman
Settling Some Open Problems on 2-Player Symmetric Nash Equilibria
272(13)
Ruta Mehta
Vijay V. Vazirani
Sadra Yazdanbod
Approximating Nash Equilibria in Tree Polymatrix Games
285(14)
Siddharth Barman
Katrina Ligett
Georgios Piliouras
Abstracts and Brief Announcements
Commitment in First-Price Auctions
299(1)
Yunjian Xu
Katrina Ligett
Brief Announcement: Effect of Strategic Grading and Early Offers in Matching Markets
300(3)
Hedyeh Beyhaghi
Nishanth Dikkala
Eva Tardos
Brief Announcement: New Mechanisms for Pairwise Kidney Exchange
303(2)
Hossein Efsandiari
Guy Kortsarz
Brief Announcement: On Effective Affirmative Action in School Choice
305(2)
Yun Liu
Brief Announcement: Resource Allocation Games with Multiple Resource Classes
307(2)
Roy B. Ofer
Tami Tamir
Brief Announcement: On the Fair Subset Sum Problem
309(3)
Gaia Nicosia
Andrea Pacifici
Ulrich Pferschy
Brief Announcement: Computation of Fisher-Gale Equilibrium by Auction
312(3)
Yurii Nesterov
Vladimir Shikhman
Author Index 315