Optimal Stopping with Interdependent Values

Συγγραφείς: Mauras, Simon, Mohan, Divyarthi, Reiffenhäuser, Rebecca

Συνεισφορές: Mauras, Simon

Πηγή: Proceedings of the 25th ACM Conference on Economics and Computation. :246-265

Θεματικοί όροι: Online Selection, FOS: Computer and information sciences, Truthful Mechanisms, Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, Online algorithms, [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], Data Structures and Algorithms (cs.DS), Optimal Stopping, Algorithmic game theory and mechanism design, Theory of computation, Computer Science and Game Theory (cs.GT)

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2404.06293
https://hdl.handle.net/11245.1/92e1b612-17ec-407c-acf7-8b85280b4cb5
https://doi.org/10.1145/3670865.3673628
https://dare.uva.nl/personal/pure/en/publications/optimal-stopping-with-interdependent-values(92e1b612-17ec-407c-acf7-8b85280b4cb5).html
https://hal.science/hal-04923199v1/document
https://doi.org/10.1145/3670865.3673628
https://hal.science/hal-04923199v1

Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations

Συγγραφείς: Feldman, Michal, Mauras, Simon, Narayan, Vishnu, Ponitka, Tomasz

Συνεισφορές: Mauras, Simon

Πηγή: Proceedings of the 25th ACM Conference on Economics and Computation. :1236-1266

Θεματικοί όροι: Best-of-Both-Worlds, Subadditive, FOS: Computer and information sciences, Envy-Cycles, Computer Science - Computer Science and Game Theory, [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], Fair Division, Algorithmic game theory and mechanism design, Theory of computation, Computer Science and Game Theory (cs.GT)

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2304.03706
https://hal.science/hal-04923223v1
https://hal.science/hal-04923223v1/document
https://doi.org/10.1145/3670865.3673592

Team Formation amidst Conflicts

Συγγραφείς: Iasonas Nikolaou, Evimaria Terzi

Πηγή: Proceedings of the ACM Web Conference 2024. :2417-2428

Θεματικοί όροι: Social Networks, Computer Science - Artificial Intelligence, Computer Science - Computer Science and Game Theory, Theory of Computation, Computer Science - Social and Information Networks, Theory and Algorithms for Application Domains, Algorithmic Game Theory and Mechanism Design

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2403.00859

Online Combinatorial Allocation with Interdependent Values

Συγγραφείς: Feldman, Michal, Mauras, Simon, Mohan, Divyarthi, Reiffenhäuser, Rebecca

Συνεισφορές: 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

Πηγή: 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⟩

Θεματικοί όροι: 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]

Θέμα γεωγραφικό: Stanford, United States

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

Διαθεσιμότητα: 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

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

Συγγραφείς: Garg, Jugal, Husić, Edin, Végh, László A.

Συνεισφορές: Jugal Garg and Edin Husić and László A. Végh, Blaser, Markus, Monmege, Benjamin, Bläser, Markus

Πηγή: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021).

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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/

The Random Assignment Problem with Submodular Constraints on Goods

Συγγραφείς: Fujishige, Satoru, Sano, Yoshio, Zhan, Ping

Συνεισφορές: 藤重, 悟

Πηγή: ACM Transactions on Economics and Computation. 6:1-28

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

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

Συγγραφείς: Avrachenkov, Konstantin, Goseling, Jasper, Serbetci, Berksan

Συνεισφορές: 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

Πηγή: 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⟩

Θεματικοί όροι: 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]

Relation: hal-01648129; https://hal.inria.fr/hal-01648129; https://hal.inria.fr/hal-01648129/document; https://hal.inria.fr/hal-01648129/file/main.pdf

Διαθεσιμότητα: https://hal.inria.fr/hal-01648129
https://hal.inria.fr/hal-01648129/document
https://hal.inria.fr/hal-01648129/file/main.pdf
https://doi.org/10.1145/3084465

The Random Assignment Problem with Submodular Constraints on Goods.

Συγγραφείς: Sano, Yoshio, Zhan, Ping, Fujishige, Satoru

Όροι ευρετηρίου: Theory of computation, Algorithmic game theory and mechanism design, Discrete optimization, Random assignment, probabilistic serial mechanism, ordinal preference, matchings, polymatroids, independent flows, submodular optimization, weak Nash equilibrium, Journal Article., AM.

Σύνδεσμος: http://hdl.handle.net/2433/228999
https://doi.org/10.1145/3175496
http://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/228999/1/3175496.pdf