IDEAS home Printed from https://ideas.repec.org/r/cup/cbooks/9780521872829.html
   My bibliography  Save this item

Algorithmic Game Theory

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Kuzmicz, Katarzyna Anna & Pesch, Erwin, 2019. "Approaches to empty container repositioning problems in the context of Eurasian intermodal transportation," Omega, Elsevier, vol. 85(C), pages 194-213.
  2. Ashish R. Hota & Shreyas Sundaram, 2018. "Controlling Human Utilization of Failure-Prone Systems via Taxes," Papers 1802.09490, arXiv.org, revised Apr 2020.
  3. Umang Bhaskar & Lisa Fleischer & Darrell Hoy & Chien-Chung Huang, 2015. "On the Uniqueness of Equilibrium in Atomic Splittable Routing Games," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 634-654, March.
  4. Sprumont, Yves, 2013. "Constrained-optimal strategy-proof assignment: Beyond the Groves mechanisms," Journal of Economic Theory, Elsevier, vol. 148(3), pages 1102-1121.
  5. Le Cadre, Hélène & Mezghani, Ilyès & Papavasiliou, Anthony, 2019. "A game-theoretic analysis of transmission-distribution system operator coordination," European Journal of Operational Research, Elsevier, vol. 274(1), pages 317-339.
  6. Knight, Vincent A. & Harper, Paul R., 2013. "Selfish routing in public services," European Journal of Operational Research, Elsevier, vol. 230(1), pages 122-132.
  7. de Clippel, Geoffroy & Naroditskiy, Victor & Polukarov, Maria & Greenwald, Amy & Jennings, Nicholas R., 2014. "Destroy to save," Games and Economic Behavior, Elsevier, vol. 86(C), pages 392-404.
    • Geoffroy de Clippel & Louis Putterman & Victor Naroditskiy & Maria Polukarov & Amy Greenwald & Nicholas R. Jennings, 2012. "Destroy to Save," Working Papers 2012-9, Brown University, Department of Economics.
  8. Zhang, Qi & Wang, Wenyuan & Peng, Yun & Zhang, Junyi & Guo, Zijian, 2018. "A game-theoretical model of port competition on intermodal network and pricing strategy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 19-39.
  9. Devanur, Nikhil R. & Garg, Jugal & Végh, László A., 2016. "A rational convex program for linear Arrow-Debreu markets," LSE Research Online Documents on Economics 69224, London School of Economics and Political Science, LSE Library.
  10. Bichler, Martin & Merting, Sören, 2018. "Truthfulness in advertising? Approximation mechanisms for knapsack bidders," European Journal of Operational Research, Elsevier, vol. 270(2), pages 775-783.
  11. Schiewe, Alexander & Schiewe, Philine & Schmidt, Marie, 2019. "The line planning routing game," European Journal of Operational Research, Elsevier, vol. 274(2), pages 560-573.
  12. Perez-Diaz, Alvaro & Gerding, Enrico & McGroarty, Frank, 2018. "Coordination and payment mechanisms for electric vehicle aggregators," Applied Energy, Elsevier, vol. 212(C), pages 185-195.
  13. Zou, Bo & Kafle, Nabin & Wolfson, Ouri & Lin, Jie (Jane), 2015. "A mechanism design based approach to solving parking slot assignment in the information era," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 631-653.
  14. Babichenko, Yakov & Tamuz, Omer, 2016. "Graphical potential games," Journal of Economic Theory, Elsevier, vol. 163(C), pages 889-899.
  15. Chun, Youngsub & Yengin, Duygu, 2017. "Welfare lower bounds and strategy-proofness in the queueing problem," Games and Economic Behavior, Elsevier, vol. 102(C), pages 462-476.
  16. Neeman, Zvika & Pavlov, Gregory, 2008. "Renegotiation-Proof Mechanism Design," Foerder Institute for Economic Research Working Papers 275717, Tel-Aviv University > Foerder Institute for Economic Research.
  17. Dominik Kress & Sebastian Meiswinkel & Erwin Pesch, 2018. "Mechanism design for machine scheduling problems: classification and literature overview," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 583-611, July.
  18. Homberger, Jörg & Fink, Andreas, 2017. "Generic negotiation mechanisms with side payments – Design, analysis and application for decentralized resource-constrained multi-project scheduling problems," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1001-1012.
  19. Papadimitriou, Christos & Pierrakos, George, 2015. "Optimal deterministic auctions with correlated priors," Games and Economic Behavior, Elsevier, vol. 92(C), pages 430-454.
  20. Eric Bax, 2019. "Computing a Data Dividend," Papers 1905.01805, arXiv.org, revised Jun 2019.
  21. Supreet Mandala & Soundar Kumara & Kalyan Chatterjee, 2014. "A Game-Theoretic Approach to Graph Clustering," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 629-643, August.
  22. Snehalkumar & S. Gaikwad & Durim Morina & Adam Ginzberg & Catherine Mullings & Shirish Goyal & Dilrukshi Gamage & Christopher Diemert & Mathias Burton & Sharon Zhou & Mark Whiting & Karolina Ziulkoski, 2019. "Boomerang: Rebounding the Consequences of Reputation Feedback on Crowdsourcing Platforms," Papers 1904.06722, arXiv.org.
  23. Stößer, Jochen & Neumann, Dirk & Weinhardt, Christof, 2010. "Market-based pricing in grids: On strategic manipulation and computational cost," European Journal of Operational Research, Elsevier, vol. 203(2), pages 464-475, June.
  24. Hara, Yusuke, 2018. "Behavioral mechanism design for transportation services: Laboratory experiments and preference elicitation cost," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 231-245.
  25. Harsha Honnappa & Rahul Jain, 2015. "Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game," Operations Research, INFORMS, vol. 63(1), pages 247-259, February.
  26. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
  27. Hota, Ashish R. & Garg, Siddharth & Sundaram, Shreyas, 2016. "Fragility of the commons under prospect-theoretic risk attitudes," Games and Economic Behavior, Elsevier, vol. 98(C), pages 135-164.
  28. repec:wsi:jeapmx:v:20:y:2018:i:04:n:s0219198918500068 is not listed on IDEAS
  29. Dennis Clerck & Erik Demeulemeester, 2016. "A sequential procurement model for a PPP project pipeline," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 427-457, March.
  30. Kovalyov, Mikhail Y. & Pesch, Erwin, 2014. "A game mechanism for single machine sequencing with zero risk," Omega, Elsevier, vol. 44(C), pages 104-110.
  31. Philippe Bich & Rida Laraki, 2014. "On the Existence of Approximate Equilibria and Sharing Rule Solutions in Discontinuous Games," Working Papers hal-01071678, HAL.
  32. Qiaoming Han & Donglei Du & Dachuan Xu & Yicheng Xu, 2018. "Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain," Journal of Global Optimization, Springer, vol. 70(4), pages 859-873, April.
  33. Chaithanya Bandi & Dimitris Bertsimas, 2014. "Optimal Design for Multi-Item Auctions: A Robust Optimization Approach," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 1012-1038, November.
  34. Lina Mallozzi, 2013. "An application of optimization theory to the study of equilibria for games: a survey," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(3), pages 523-539, September.
  35. László A. Végh, 2014. "Concave Generalized Flows with Applications to Market Equilibria," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 573-596, May.
  36. Nasimeh Heydaribeni & Achilleas Anastasopoulos, 2019. "Distributed Mechanism Design for Network Resource Allocation Problems," Papers 1904.01222, arXiv.org.
  37. Balmaceda, Felipe & Balseiro, Santiago R. & Correa, José R. & Stier-Moses, Nicolás E., 2016. "Bounds on the welfare loss from moral hazard with limited liability," Games and Economic Behavior, Elsevier, vol. 95(C), pages 137-155.
  38. Hélène Le Cadre, 2018. "On the Efficiency of Local Electricity Markets Under Decentralized and Centralized Designs: A Multi-leader Stackelberg Game Analysis," Working Papers hal-01619885, HAL.
  39. Lin Gao & Biying Shou & Ying-Ju Chen & Jianwei Huang, 2016. "Combining Spot and Futures Markets: A Hybrid Market Approach to Dynamic Spectrum Access," Operations Research, INFORMS, vol. 64(4), pages 794-821, August.
  40. Wu, Qiong & Ren, Hongbo & Gao, Weijun & Ren, Jianxing & Lao, Changshi, 2017. "Profit allocation analysis among the distributed energy network participants based on Game-theory," Energy, Elsevier, vol. 118(C), pages 783-794.
  41. Dütting, Paul & Henzinger, Monika & Starnberger, Martin, 2018. "Valuation compressions in VCG-based combinatorial auctions," LSE Research Online Documents on Economics 87419, London School of Economics and Political Science, LSE Library.
  42. Stéphane Cordier & Nicolas Debarsy & Cem Ertur & François Nemo & Déborah Nourrit & Gérard Poisson & Christel Vrain, 2016. "Interactions in Complex Systems," Working Papers halshs-01377409, HAL.
  43. Bian, Zheyong & Liu, Xiang, 2019. "Mechanism design for first-mile ridesharing based on personalized requirements part I: Theoretical analysis in generalized scenarios," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 147-171.
  44. Jason R. Marden & Adam Wierman, 2013. "Distributed Welfare Games," Operations Research, INFORMS, vol. 61(1), pages 155-168, February.
  45. Akiyoshi Shioura, 2015. "Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 192-225, February.
  46. Rota Bulò, Samuel & Pelillo, Marcello, 2017. "Dominant-set clustering: A review," European Journal of Operational Research, Elsevier, vol. 262(1), pages 1-13.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.