Algorithmic Game Theory
portes grátis
Algorithmic Game Theory
15th International Symposium, SAGT 2022, Colchester, UK, September 12-15, 2022, Proceedings
Kanellopoulos, Panagiotis; Kyropoulou, Maria; Voudouris, Alexandros
Springer International Publishing AG
09/2022
589
Mole
Inglês
9783031157134
15 a 20 dias
926
Descrição não disponível.
Invited Talk.- Decentralizing Information Technology: The Advent of Resource Based Systems.- Auctions, Markets and Mechanism Design.- How Bad is the Merger Paradox.- Greater Flexibility in Mechanism Design Through Altruism.- Lookahead Auctions with Pooling.- Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents.- On Improved Interval Cover Mechanisms for Crowdsourcing Markets.- Explicitly Simple Near-tie Auctions.- Computational Aspects in Games.- Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy.- Complexity of Public Goods Games on Graphs.- PPAD-Complete Pure Approximate Nash Equilibria in Lipschitz Games.- Seniorities and Minimal Clearing in Financial Network Games.- Financial Networks with Singleton Liability Priorities.- Automated Equilibrium Analysis of 2 2 2 Games.- Congestion and Network Creation Games.- An Improved Bound for the Tree Conjecture in Network Creation Games.- A common generalizationof budget games and congestion games.- Cost-Sharing Games with Rank-Based Utilities.- On Tree Equilibria in Max-Distance Network Creation Games.- On the Impact of Player Capability on Congestion Games.- Data Sharing and Learning.- Learning Approximately Optimal Contracts.- Coopetition Against an Amazon.- Data Curation from Privacy-Aware Agents.- Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games.- Social Choice and Stable Matchings.- Decentralised Update Selection with Semi-Strategic Experts.- Fair ride allocation on a line.- Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences.- Collective Schedules: Axioms and algorithms.- Justifying Groups in Multiwinner Approval Voting.- Fairness in Temporal Slot Assignment.- Gehrlein Stable Committee with Multi-Modal Preferences. -Online Max-min Fair Allocation.- Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas.- Strategic Voting in the Context of Stable-Matching of Teams.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Algorithmic Game Theory;approximation theory;artificial intelligence;Auctions;Computational Aspects of Games;computer vision;Equilibria;game theory;graph theory;Human-Computer Interaction (HCI);Markets;Matchings;Mechanism Design;network protocols;Price of Anarchy;Social Choice;telecommunication systems;user interfaces;Voting
Invited Talk.- Decentralizing Information Technology: The Advent of Resource Based Systems.- Auctions, Markets and Mechanism Design.- How Bad is the Merger Paradox.- Greater Flexibility in Mechanism Design Through Altruism.- Lookahead Auctions with Pooling.- Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents.- On Improved Interval Cover Mechanisms for Crowdsourcing Markets.- Explicitly Simple Near-tie Auctions.- Computational Aspects in Games.- Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy.- Complexity of Public Goods Games on Graphs.- PPAD-Complete Pure Approximate Nash Equilibria in Lipschitz Games.- Seniorities and Minimal Clearing in Financial Network Games.- Financial Networks with Singleton Liability Priorities.- Automated Equilibrium Analysis of 2 2 2 Games.- Congestion and Network Creation Games.- An Improved Bound for the Tree Conjecture in Network Creation Games.- A common generalizationof budget games and congestion games.- Cost-Sharing Games with Rank-Based Utilities.- On Tree Equilibria in Max-Distance Network Creation Games.- On the Impact of Player Capability on Congestion Games.- Data Sharing and Learning.- Learning Approximately Optimal Contracts.- Coopetition Against an Amazon.- Data Curation from Privacy-Aware Agents.- Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games.- Social Choice and Stable Matchings.- Decentralised Update Selection with Semi-Strategic Experts.- Fair ride allocation on a line.- Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences.- Collective Schedules: Axioms and algorithms.- Justifying Groups in Multiwinner Approval Voting.- Fairness in Temporal Slot Assignment.- Gehrlein Stable Committee with Multi-Modal Preferences. -Online Max-min Fair Allocation.- Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas.- Strategic Voting in the Context of Stable-Matching of Teams.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Algorithmic Game Theory;approximation theory;artificial intelligence;Auctions;Computational Aspects of Games;computer vision;Equilibria;game theory;graph theory;Human-Computer Interaction (HCI);Markets;Matchings;Mechanism Design;network protocols;Price of Anarchy;Social Choice;telecommunication systems;user interfaces;Voting
