In this paper we deal with a type of extended combinatorialgame, modulo 2 *** the game a tie position may be *** introduce a system of logical functions to expose the properties of the *** sufficient and necessary co...
详细信息
In this paper we deal with a type of extended combinatorialgame, modulo 2 *** the game a tie position may be *** introduce a system of logical functions to expose the properties of the *** sufficient and necessary conditions that there exists a winning strategy for the first player or the second player are *** for implementing the optimal strategy and its complexity are also given.
We discuss an integer programming formulation for a class of cooperative games. We focus on algorithmic aspects of the core, one of the most important solution concepts in cooperative gametheory. Central to our study...
详细信息
We discuss an integer programming formulation for a class of cooperative games. We focus on algorithmic aspects of the core, one of the most important solution concepts in cooperative gametheory. Central to our study is a simple (but very useful) observation that the core for this class is nonempty if and only if an associated linear program has an integer optimal solution. Based on this, we study the computational complexity and algorithms to answer important questions about the cores of various games on graphs, such as maximum flow, connectivity, maximum matching, minimum vertex cover, minimum edge cover, maximum independent set, and minimum coloring.
We introduce a general integer programming formulation for a class of combinatorial optimization games, immediately allows us to improve the algorithmic result for finding imputations in the core (an important solutio...
详细信息
ISBN:
(纸本)0898713900
We introduce a general integer programming formulation for a class of combinatorial optimization games, immediately allows us to improve the algorithmic result for finding imputations in the core (an important solution concept in cooperative gametheory) of the network Bow game on simple networks by Kalai and Zemel [16]. An interesting result is a general theorem that the core for this class of games is nonempty if and only if a related Linear program has an integer optimal solution. We study the properties for this mathematical condition to hold for several interesting problems, and apply them to resolve algorithmic and complexity issues for their cores along the Line as put forward in [2,19]: decide whether the core is empty;if the core is empty, find an imputation in the core;given an imputation 2, test whether x is in the core. We also explore the properties of totally balanced games in this succinct formulation of cooperative games.
This book constitutes the refereed proceedings of the 34th International Workshop on combinatorial Algorithms, IWOCA 2023, held in Tainan, Taiwan, during June 7–10, 2023.;The 33 full papers included in this book...
详细信息
ISBN:
(数字)9783031343476
ISBN:
(纸本)9783031343469
This book constitutes the refereed proceedings of the 34th International Workshop on combinatorial Algorithms, IWOCA 2023, held in Tainan, Taiwan, during June 7–10, 2023.;The 33 full papers included in this book were carefully reviewed and selected from 86 submissions. They were organized in topical sections as follows: algorithms and data structures; algorithmic and combinatorical aspects of cryptography and information security; algorithmicgametheory and complexity of games; approximation algorithms; complexity theory; combinatorics and graph theory; combinatorial generation, enumeration and counting; combinatorial optimization; combinatorics of words; computational biology; computational geometry; decompositions and combinatorial designs; distributed and network algorithms; experimental combinatorics; fine-grained complexity; graph algorithms and modelling with graphs; graph drawing and graph labelling; network theoryand temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic and randomized algorithms; and streaming algorithms.
The advent of the Internet has opened up a wealth of applications, but also given rise to a host of new problems. Many of those problems have led to - citing new research directions in mathematics and theoretical comp...
详细信息
ISBN:
(数字)9783540772941
ISBN:
(纸本)9783540772934
The advent of the Internet has opened up a wealth of applications, but also given rise to a host of new problems. Many of those problems have led to - citing new research directions in mathematics and theoretical computer science, especially in the areas of combinatorics and algorithms. The Fourth Workshop on combinatorial and algorithmic Aspects of Networking (CAAN 2007) was organized to be a place where the latest research developments on all aspects of networking could be presented. The topics covered were diverse, with talks on strategies for searching in networks, for cleaning networks of unwanted - truders, on di?erent routing strategies, and on scheduling and load balancing. The workshop started with an invited lecture by Peter Winkler of Dartmouth College, who gave a general talk on a topic related to probability, a concept central to network modeling and managing. The afternoon opened with a short invited talk by Alejandro Lop ´ ez-Ortiz, who gave an overview of various issues in designing resilient backbone networks. CAAN 2007 took place on August 14, 2007, at Dalhousie University in Halifax, Nova Scotia, Canada, co-located with the Workshop on Algorithms and Data Structures (WADS 2007). Three previous CAAN workshops were held in Chester, UK (CAAN 2006), Waterloo, Ontario, Canada (CAAN 2005), and in Ban?, Alberta, Canada (CAAN 2004), respectively.
This volume contains the papers presented at the 11th International Wo- shop on Approximation Algorithms for combinatorial Optimization Problems (APPROX 2008) and the 12th International Workshop on Randomization and C...
详细信息
ISBN:
(数字)9783540853633
ISBN:
(纸本)9783540853626
This volume contains the papers presented at the 11th International Wo- shop on Approximation Algorithms for combinatorial Optimization Problems (APPROX 2008) and the 12th International Workshop on Randomization and Computation (RANDOM 2008), which took place concurrently at the MIT (M- sachusetts Institute of Technology) in Boston, USA, during August 25–27, 2008. APPROX focuses on algorithmic and complexity issues surrounding the development of e?cient approximate solutions to computationally di?cult problems, and was the 11th in the series after Aalborg (1998), Berkeley (1999), Saarbru ¨cken (2000), Berkeley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 12th workshop in the series following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). Topics of interest for APPROX and RANDOM are: design and analysis of - proximation algorithms, hardness of approximation, small space, sub-linear time, streaming, algorithms, embeddings and metric space methods, mathematical programming methods, combinatorial problems in graphs and networks, game t- ory, markets, economic applications, geometric problems, packing, covering, scheduling, approximate learning, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and - beddings, error-correcting codes,average-case analysis, property testing, com- tational learning theory, and other applications of approximation and randomness.
暂无评论