Výsledky vyhľadávania - "Algorithmic Game Theory and Mechanism Design"

Optimal Stopping with Interdependent Values

Autori: Mauras, Simon Mohan, Divyarthi Reiffenhäuser, Rebecca

Prispievatelia: Mauras, Simon Mohan, Divyarthi Reiffenhäuser, Rebecca

Zdroj: Proceedings of the 25th ACM Conference on Economics and Computation. :246-265

Predmety: 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)

Popis súboru: application/pdf

Prístupová URL adresa: 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

Autori: Feldman, Michal Mauras, Simon Narayan, Vishnu a ďalší

Prispievatelia: Feldman, Michal Mauras, Simon Narayan, Vishnu a ďalší

Zdroj: Proceedings of the 25th ACM Conference on Economics and Computation. :1236-1266

Predmety: 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)

Popis súboru: application/pdf

Prístupová URL adresa: 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

Autori: Iasonas Nikolaou Evimaria Terzi

Zdroj: Proceedings of the ACM Web Conference 2024. :2417-2428

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2403.00859

Online Combinatorial Allocation with Interdependent Values

Autori: Feldman, Michal Mauras, Simon Mohan, Divyarthi a ďalší

Prispievatelia: Feldman, Michal Mauras, Simon Mohan, Divyarthi a ďalší

Zdroj: 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⟩

Predmety: 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]

Geografické téma: Stanford, United States

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

Dostupnosť: 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

Autori: Garg, Jugal Husić, Edin Végh, László A. a ďalší

Prispievatelia: Garg, Jugal Husić, Edin Végh, László A. a ďalší

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

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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

Autori: Fujishige, Satoru Sano, Yoshio Zhan, Ping a ďalší

Prispievatelia: Fujishige, Satoru Sano, Yoshio Zhan, Ping a ďalší

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

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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

Autori: Avrachenkov, Konstantin Goseling, Jasper Serbetci, Berksan a ďalší

Prispievatelia: Avrachenkov, Konstantin Goseling, Jasper Serbetci, Berksan a ďalší

Zdroj: 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⟩

Predmety: 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

Dostupnosť: 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.

Autori: Sano, Yoshio Zhan, Ping Fujishige, Satoru

Témy: 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.

URL: 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