Abstract is missing.
- Computational Game TheoryBruno Codenotti. 1 [doi]
- Computation and Incentives of Competitive Equilibria in a Matching MarketNing Chen, Xiaotie Deng. 2-6 [doi]
- Repeated Budgeted Second Price Ad AuctionAsaph Arnon, Yishay Mansour. 7-18 [doi]
- Prompt Mechanism for Ad Placement over TimeYossi Azar, Ety Khaitsin. 19-30 [doi]
- The Multiple Attribution Problem in Pay-Per-Conversion AdvertisingPatrick R. Jordan, Mohammad Mahdian, Sergei Vassilvitskii, Erik Vee. 31-43 [doi]
- On Communication Protocols That Compute Almost PrivatelyMarco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan. 44-56 [doi]
- Dynamic Inefficiency: Anarchy without StabilityNoam Berger, Michal Feldman, Ofer Neiman, Mishael Rosenthal. 57-68 [doi]
- Throw One's Cake - and Eat It TooOrit Arzi, Yonatan Aumann, Yair Dombb. 69-80 [doi]
- The Price of Optimum in a Matching GameBruno Escoffier, Laurent Gourvès, Jérôme Monnot. 81-92 [doi]
- Pareto Optimality in Coalition FormationHaris Aziz, Felix Brandt, Paul Harrenstein. 93-104 [doi]
- Externalities among Advertisers in Sponsored SearchDimitris Fotakis, Piotr Krysta, Orestis Telelis. 105-116 [doi]
- Peer Effects and Stability in Matching MarketsElizabeth Bodine-Baron, Christina Lee, Anthony Chong, Babak Hassibi, Adam Wierman. 117-129 [doi]
- Steady Marginality: A Uniform Approach to Shapley Value for Games with ExternalitiesOskar Skibski. 130-142 [doi]
- Scheduling without PaymentsElias Koutsoupias. 143-153 [doi]
- Combinatorial Agency of Threshold FunctionsShaili Jain, David C. Parkes. 154-165 [doi]
- Lower Bound for Envy-Free and Truthful Makespan Approximation on Related MachinesLisa Fleischer, Zhenghui Wang. 166-177 [doi]
- A Truthful Mechanism for Value-Based Scheduling in Cloud ComputingNavendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv. 178-189 [doi]
- Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)Panagiota N. Panagopoulou, Paul G. Spirakis. 190-199 [doi]
- Complexity of Rational and Irrational Nash EquilibriaVittorio Bilò, Marios Mavronicolas. 200-211 [doi]
- Diffusion in Social Networks with Competing ProductsKrzysztof R. Apt, Evangelos Markakis. 212-223 [doi]
- A Clustering Coefficient Network Formation GameMichael Brautbar, Michael Kearns. 224-235 [doi]
- On the Existence of Pure Strategy Nash Equilibria in Integer-Splittable Weighted Congestion GamesLong Tran-Thanh, Maria Polukarov, Archie C. Chapman, Alex Rogers, Nicholas R. Jennings. 236-253 [doi]
- On Dynamics in Basic Network Creation GamesPascal Lenzner. 254-265 [doi]
- Pricing Exotic Derivatives Using Regret MinimizationEyal Gofer, Yishay Mansour. 266-277 [doi]
- Strategic Pricing in Next-Hop Routing with Elastic DemandsElliot Anshelevich, Ameya Hate, Koushik Kar. 278-289 [doi]
- Weakly-Acyclic (Internet) Routing GamesRoee Engelberg, Michael Schapira. 290-301 [doi]
- Efficiency of Restricted Tolls in Non-atomic Network Routing GamesVincenzo Bonifaci, Mahyar Salek, Guido Schäfer. 302-313 [doi]
- Stochastic Selfish RoutingEvdokia Nikolova, Nicolás E. Stier Moses. 314-325 [doi]