Search Results - "Algorithmic Game Theory and Mechanism Design"

Contributors: Tel Aviv University (TAU), IA coopérative : équité, vie privée, incitations (FAIRPLAY), Centre de Recherche en Économie et Statistique (CREST), Ecole Nationale de la Statistique et de l'Analyse de l'Information Bruz (ENSAI), Groupe des Écoles Nationales d'Économie et Statistique (GENES)-Groupe des Écoles Nationales d'Économie et Statistique (GENES)-École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-École Nationale de la Statistique et de l'Administration Économique (ENSAE Paris), Groupe des Écoles Nationales d'Économie et Statistique (GENES)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)-Ecole Nationale de la Statistique et de l'Analyse de l'Information Bruz (ENSAI), Groupe des Écoles Nationales d'Économie et Statistique (GENES)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)-Criteo AI Lab, Criteo Paris -Criteo Paris -Centre Inria de l'Institut Polytechnique de Paris, Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Boston University Boston (BU), Universiteit van Amsterdam = University of Amsterdam (UvA), This work was supported in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement No. 866132

Source: EC 2025 - 26th ACM Conference on Economics and Computation ; https://hal.science/hal-05225654 ; EC 2025 - 26th ACM Conference on Economics and Computation, Jul 2025, Stanford, United States. pp.189-205, ⟨10.1145/3736252.3742518⟩

Subject Terms: Interdependent Valuations, Combinatorial Auctions, Online Algorithms, CCS Concepts: • Theory of computation → Theory and algorithms for application domains, Algorithmic game theory and mechanism design, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT]

Subject Geographic: Stanford, United States

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2507.23500; ARXIV: 2507.23500

Availability: https://hal.science/hal-05225654
https://hal.science/hal-05225654v1/document
https://hal.science/hal-05225654v1/file/3736252.3742518.pdf
https://doi.org/10.1145/3736252.3742518

View record from BASE

5

Academic Journal

auction algorithms for market equilibrium with weak gross substitute demands and their applications

Authors: Garg, Jugal, Husić, Edin, Végh, László A.

Contributors: Jugal Garg and Edin Husić and László A. Végh, Blaser, Markus, Monmege, Benjamin, Bläser, Markus

Source: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021).

Subject Terms: Fisher equilibrium, auction algorithm, Nash social welfare, Theory of computation → Design and analysis of algorithms, Gale equilibrium, ddc:004, weak gross substitutes, Theory of computation → Algorithmic game theory and mechanism design

File Description: application/pdf

Access URL: https://experts.illinois.edu/en/publications/auction-algorithms-for-market-equilibrium-with-weak-gross-substit-2
https://drops.dagstuhl.de/opus/volltexte/2021/13678/
https://drops.dagstuhl.de/opus/volltexte/2021/13678/pdf/LIPIcs-STACS-2021-33.pdf/
https://dblp.uni-trier.de/db/conf/stacs/stacs2021.html#GargHV21
https://doi.org/10.4230/LIPIcs.STACS.2021.33
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.33
http://eprints.lse.ac.uk/113500/

View record at OpenAIRE

6

Academic Journal

The Random Assignment Problem with Submodular Constraints on Goods

Authors: Fujishige, Satoru, Sano, Yoshio, Zhan, Ping

Contributors: 藤重, 悟

Source: ACM Transactions on Economics and Computation. 6:1-28

Subject Terms: polymatroids, ordinal preference, 05 social sciences, 0211 other engineering and technologies, weak Nash equilibrium, 02 engineering and technology, 16. Peace & justice, independent flows, submodular optimization, 0502 economics and business, Discrete optimization, matchings, Algorithmic game theory and mechanism design, Random assignment, probabilistic serial mechanism, Theory of computation

File Description: application/pdf

Access URL: https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/228999/1/3175496.pdf
https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/228999/1/3175496.pdf
https://core.ac.uk/display/160456413
https://dl.acm.org/doi/10.1145/3175496
https://doi.org/10.1145/3175496
https://dl.acm.org/citation.cfm?id=3175496
https://dblp.uni-trier.de/db/journals/teco/teco6.html#FujishigeSZ18

View record at OpenAIRE

Linked Full Text

7

Academic Journal

A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints

Authors: Avrachenkov, Konstantin, Goseling, Jasper, Serbetci, Berksan

Contributors: Network Engineering and Operations (NEO ), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Stochastic Operations Research Twente (SOR), University of Twente

Source: EISSN: 2476-1249 ; Proceedings of the ACM on Measurement and Analysis of Computing Systems ; https://hal.inria.fr/hal-01648129 ; Proceedings of the ACM on Measurement and Analysis of Computing Systems , 2017, 1, pp.27:1 - 27:24. ⟨10.1145/3084465⟩

Subject Terms: wireless access points, base stations and infrastructure, Algorithmic game theory and mechanism design, Caching, Wireless networks, Distributed optimization, Game theory, Simulated annealing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]